T. K. Satish Kumar

Publication Activity (10 Years)

Years Active: 2000-2023
Publications (10 Years): 114

Top Venues

CoRR

SOCS

ICAPS

AAAI

Publications

Ang Li, Peter J. Stuckey, Sven Koenig, T. K. Satish Kumar
A FastMap-Based Framework for Efficiently Computing Top-K Projected Centrality. LOD (1) (2023)
Yi Zheng, Srivatsan Ravi, Erik Kline, Lincoln Thurlow, Sven Koenig, T. K. Satish Kumar
Improved Conflict-Based Search for the Virtual Network Embedding Problem. ICCCN (2023)
Kexin Zheng, Ang Li, Han Zhang, T. K. Satish Kumar
FastMapSVM for Predicting CSP Satisfiability. CP (2023)
Han Zhang, Oren Salzman, Ariel Felner, T. K. Satish Kumar, Shawn Skyler, Carlos Hernández Ulloa, Sven Koenig
Towards Effective Multi-Valued Heuristics for Bi-objective Shortest-Path Algorithms via Differential Heuristics. SOCS (2023)
Yi Zheng, Hang Ma, Sven Koenig, Erik Kline, T. K. Satish Kumar
Priority-Based Search for the Virtual Network Embedding Problem. ICAPS (2023)
Han Zhang, Oren Salzman, Ariel Felner, T. K. Satish Kumar, Carlos Hernández Ulloa, Sven Koenig
Efficient Multi-Query Bi-Objective Search via Contraction Hierarchies. ICAPS (2023)
Weizhao Jin, Erik Kline, T. K. Satish Kumar, Lincoln Thurlow, Srivatsan Ravi
ð'3ð' : Privacy-Preserving Path Validation System for Multi-Authority Sliced Networks. IACR Cryptol. ePrint Arch. 2023 (2023)
Omkar Thakoor, T. K. Satish Kumar
Dynamic FastMap: An Efficient Algorithm for Spatiotemporal Embedding of Dynamic Graphs. FLAIRS (2023)
Omkar Thakoor, Ang Li, Sven Koenig, Srivatsan Ravi, Erik Kline, T. K. Satish Kumar
The FastMap Pipeline for Facility Location Problems. PRIMA (2022)
Han Zhang, Jiaoyang Li, Pavel Surynek, T. K. Satish Kumar, Sven Koenig
Multi-agent path finding with mutex propagation. Artif. Intell. 311 (2022)
Han Zhang, Oren Salzman, T. K. Satish Kumar, Ariel Felner, Carlos Hernández Ulloa, Sven Koenig
Anytime Approximate Bi-Objective Search. SOCS (2022)
Ang Li, Peter J. Stuckey, Sven Koenig, T. K. Satish Kumar
A FastMap-Based Algorithm for Block Modeling. CPAIOR (2022)
Han Zhang, Yutong Li, Jiaoyang Li, T. K. Satish Kumar, Sven Koenig
Mutex Propagation in Multi-Agent Path Finding for Large Agents. SOCS (2022)
Yuling Guan, Ang Li, Sven Koenig, Stephan Haas, T. K. Satish Kumar
FastPivot: An Algorithm for Inverse Problems. CASE (2022)
Chaithanya Basrur, Arambam James Singh, Arunesh Sinha, Akshat Kumar, T. K. Satish Kumar
Trajectory Optimization for Safe Navigation in Maritime Traffic Using Historical Data. CP (2022)
Malcolm C. A. White, Kushal Sharma, Ang Li, T. K. Satish Kumar, Nori Nakata
FastMapSVM: Classifying Complex Objects Using the FastMap Algorithm and Support-Vector Machines. CoRR (2022)
Han Zhang, Oren Salzman, T. K. Satish Kumar, Ariel Felner, Carlos Hernández Ulloa, Sven Koenig
A*pex: Efficient Approximate Multi-Objective Search on Graphs. ICAPS (2022)
Yi Zheng, Srivatsan Ravi, Erik Kline, Sven Koenig, T. K. Satish Kumar
Conflict-Based Search for the Virtual Network Embedding Problem. ICAPS (2022)
Jiaoyang Li, Andrew Tinka, Scott Kiesel, Joseph W. Durham, T. K. Satish Kumar, Sven Koenig
Lifelong Multi-Agent Path Finding in Large-Scale Warehouses. AAAI (2021)
Thayne T. Walker, Nathan R. Sturtevant, Ariel Felner, Han Zhang, Jiaoyang Li, T. K. Satish Kumar
Conflict-Based Increasing Cost Search. ICAPS (2021)
Yuling Guan, Ang Li, Sven Koenig, Stephan Haas, T. K. Satish Kumar
Hysteresis in Combinatorial Optimization Problems. FLAIRS Conference (2021)
Han Zhang, Mingze Yao, Ziang Liu, Jiaoyang Li, Lucas Terr, Shao-Hung Chan, T. K. Satish Kumar, Sven Koenig
A Hierarchical Approach to Multi-Agent Path Finding. SOCS (2021)
Shannon Sweitzer, T. K. Satish Kumar
Differential Programming via OR Methods. CP (2021)
Han Zhang, Neelesh Tiruviluamala, Sven Koenig, T. K. Satish Kumar
Temporal Reasoning with Kinodynamic Networks. ICAPS (2021)
Jiaoyang Li, Andrew Tinka, Scott Kiesel, Joseph W. Durham, T. K. Satish Kumar, Sven Koenig
Lifelong Multi-Agent Path Finding in Large-Scale Warehouses. CoRR (2020)
Sriram Gopalakrishnan, Liron Cohen, Sven Koenig, T. K. Satish Kumar
Embedding Directed Graphs in Potential Fields Using FastMap-D. CoRR (2020)
Pavel Surynek, Jiaoyang Li, Han Zhang, T. K. Satish Kumar, Sven Koenig
Mutex Propagation for SAT-based Multi-agent Path Finding. PRIMA (2020)
Jiaoyang Li, Andrew Tinka, Scott Kiesel, Joseph W. Durham, T. K. Satish Kumar, Sven Koenig
Lifelong Multi-Agent Path Finding in Large-Scale Warehouses. AAMAS (2020)
Ngai Meng Kou, Cheng Peng, Hang Ma, T. K. Satish Kumar, Sven Koenig
Idle Time Optimization for Target Assignment and Path Finding in Sortation Centers. AAAI (2020)
Sriram Gopalakrishnan, Liron Cohen, Sven Koenig, T. K. Satish Kumar
Embedding Directed Graphs in Potential Fields Using FastMap-D. SOCS (2020)
Jiaoyang Li, Kexuan Sun, Hang Ma, Ariel Felner, T. K. Satish Kumar, Sven Koenig
Moving Agents in Formation in Congested Environments. SOCS (2020)
Jiaoyang Li, Kexuan Sun, Hang Ma, Ariel Felner, T. K. Satish Kumar, Sven Koenig
Moving Agents in Formation in Congested Environments. AAMAS (2020)
Hong Xu, Kexuan Sun, Sven Koenig, Itay Hen, T. K. Satish Kumar
Hybrid Quantum-Classical Algorithms for Solving the Weighted CSP. ISAIM (2020)
Hong Xu, Kexuan Sun, Sven Koenig, T. K. Satish Kumar
Decision Tree Learning-Inspired Dynamic Variable Ordering for the Weighted CSP. SOCS (2020)
Han Zhang, Jiaoyang Li, Pavel Surynek, Sven Koenig, T. K. Satish Kumar
Multi-Agent Path Finding with Mutex Propagation. ICAPS (2020)
Edward Lam, Peter J. Stuckey, Sven Koenig, T. K. Satish Kumar
Exact Approaches to the Multi-agent Collective Construction Problem. CP (2020)
Ang Li, Yuling Guan, Sven Koenig, Stephan Haas, T. K. Satish Kumar
Generating the Top $K$ Solutions to Weighted CSPs: A Comparison of Different Approaches. ICTAI (2020)
Avi Pfeffer, Curt Wu, Gerald Fry, Kenny Lu, Steve Marotta, Michael Reposa, Yuan Shi, T. K. Satish Kumar, Craig A. Knoblock, David Parker, Irfan Muhammad, Chris Novakovic
Software Adaptation for an Unmanned Undersea Vehicle. IEEE Softw. 36 (2) (2019)
Pavel Surynek, T. K. Satish Kumar, Sven Koenig
Multi-Agent Path Finding with Capacity Constraints. CoRR (2019)
Jiangxing Wang, Jiaoyang Li, Hang Ma, Sven Koenig, T. K. Satish Kumar
A New Constraint Satisfaction Perspective on Multi-Agent Path Finding: Preliminary Results. AAMAS (2019)
Pavel Surynek, T. K. Satish Kumar, Sven Koenig
Multi-agent Path Finding with Capacity Constraints. AI*IA (2019)
Roni Stern, Nathan R. Sturtevant, Ariel Felner, Sven Koenig, Hang Ma, Thayne T. Walker, Jiaoyang Li, Dor Atzmon, Liron Cohen, T. K. Satish Kumar, Roman Barták, Eli Boyarski
Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks. SOCS (2019)
Manling Li, Ying Lin, Ananya Subburathinam, Spencer Whitehead, Xiaoman Pan, Di Lu, Qingyun Wang, Tongtao Zhang, Lifu Huang, Heng Ji, Alireza Zareian, Hassan Akbari, Brian Chen, Bo Wu, Emily Allaway, Shih-Fu Chang, Kathleen R. McKeown, Yixiang Yao, Jennifer Chen, Eric Berquist, Kexuan Sun, Xujun Peng, Ryan Gabbard, Marjorie Freedman, Pedro A. Szekely, T. K. Satish Kumar, Arka Sadhu, Ram Nevatia, Miguel E. Rodríguez, Yifan Wang, Yang Bai, Ali Sadeghian, Daisy Zhe Wang
GAIA at SM-KBP 2019 - A Multi-media Multi-lingual Knowledge Extraction and Hypothesis Generation System. TAC (2019)
Hang Ma, Wolfgang Hönig, T. K. Satish Kumar, Nora Ayanian, Sven Koenig
Extended Abstract: Lifelong Path Planning with Kinematic Constraintsfor Multi-Agent Pickup and Delivery. SOCS (2019)
Ngai Meng Kou, Cheng Peng, Hang Ma, T. K. Satish Kumar, Sven Koenig
Idle Time Optimization for Target Assignment and Path Finding in Sortation Centers. CoRR (2019)
Hang Ma, Wolfgang Hönig, T. K. Satish Kumar, Nora Ayanian, Sven Koenig
Lifelong Path Planning with Kinematic Constraints for Multi-Agent Pickup and Delivery. AAAI (2019)
Ka Wa Yip, Hong Xu, Sven Koenig, T. K. Satish Kumar
Quadratic Reformulation of Nonlinear Pseudo-Boolean Functions via the Constraint Composite Graph. CPAIOR (2019)
Guillaume Sartoretti, Justin Kerr, Yunfei Shi, Glenn Wagner, T. K. Satish Kumar, Sven Koenig, Howie Choset
PRIMAL: Pathfinding via Reinforcement and Imitation Multi-Agent Learning. IEEE Robotics Autom. Lett. 4 (3) (2019)
Liron Cohen, Tansel Uras, T. K. Satish Kumar, Sven Koenig
Optimal and Bounded-Suboptimal Multi-Agent Motion Planning. SOCS (2019)
Jiaoyang Li, Pavel Surynek, Ariel Felner, Hang Ma, T. K. Satish Kumar, Sven Koenig
Multi-Agent Path Finding for Large Agents. SOCS (2019)
Yuan Shi, T. K. Satish Kumar, Craig A. Knoblock
Automatic Adaptation to Sensor Replacements. FLAIRS Conference (2019)
Roni Stern, Nathan R. Sturtevant, Ariel Felner, Sven Koenig, Hang Ma, Thayne T. Walker, Jiaoyang Li, Dor Atzmon, Liron Cohen, T. K. Satish Kumar, Eli Boyarski, Roman Barták
Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks. CoRR (2019)
Kexuan Sun, Krishna Akhil Maddali, Shriraj Salian, T. K. Satish Kumar
Top K Hypotheses Selection on a Knowledge Graph. FLAIRS Conference (2019)
Jiaoyang Li, Ariel Felner, Sven Koenig, T. K. Satish Kumar
Using FastMap to Solve Graph Problems in a Euclidean Space. ICAPS (2019)
Jiaoyang Li, Pavel Surynek, Ariel Felner, Hang Ma, T. K. Satish Kumar, Sven Koenig
Multi-Agent Path Finding for Large Agents. AAAI (2019)
Masaru Nakajima, Hong Xu, Sven Koenig, T. K. Satish Kumar
Towards Understanding the Min-Sum Message Passing Algorithm for the Minimum Weighted Vertex Cover Problem: An Analytical Approach. ISAIM (2018)
T. K. Satish Kumar, Zhi Wang, Anoop Kumar, Craig Milo Rogers, Craig A. Knoblock
On the Linear Programming Duals of Temporal Reasoning Problems. ISAIM (2018)
Hang Ma, Wolfgang Hönig, T. K. Satish Kumar, Nora Ayanian, Sven Koenig
Lifelong Path Planning with Kinematic Constraints for Multi-Agent Pickup and Delivery. CoRR (2018)
T. K. Satish Kumar, Hong Xu, Zheng Tang, Anoop Kumar, Craig Milo Rogers, Craig A. Knoblock
Alert Generation in Execution Monitoring Using Resource Envelopes. FLAIRS Conference (2018)
Tongtao Zhang, Ananya Subburathinam, Ge Shi, Lifu Huang, Di Lu, Xiaoman Pan, Manling Li, Boliang Zhang, Qingyun Wang, Spencer Whitehead, Heng Ji, Alireza Zareian, Hassan Akbari, Brian Chen, Ruiqi Zhong, Steven Shao, Emily Allaway, Shih-Fu Chang, Kathleen R. McKeown, Dongyu Li, Xin Huang, Kexuan Sun, Xujun Peng, Ryan Gabbard, Marjorie Freedman, Mayank Kejriwal, Ram Nevatia, Pedro A. Szekely, T. K. Satish Kumar, Ali Sadeghian, Giacomo Bergami, Sourav Dutta, Miguel E. Rodríguez, Daisy Zhe Wang
GAIA - A Multi-media Multi-lingual Knowledge Extraction and Hypothesis Generation System. TAC (2018)
Hong Xu, Xin-Zeng Wu, Cheng Cheng, Sven Koenig, T. K. Satish Kumar
The Buss Reduction for the k-Weighted Vertex Cover Problem. ISAIM (2018)
Hang Ma, Wolfgang Hönig, Liron Cohen, Tansel Uras, Hong Xu, T. K. Satish Kumar, Nora Ayanian, Sven Koenig
Overview: A Hierarchical Framework for Plan Generation and Execution in Multi-Robot Systems. CoRR (2018)
Liron Cohen, Glenn Wagner, David M. Chan, Howie Choset, Nathan R. Sturtevant, Sven Koenig, T. K. Satish Kumar
Rapid Randomized Restarts for Multi-Agent Path Finding Solvers. SOCS (2018)
Ferdinando Fioretto, Hong Xu, Sven Koenig, T. K. Satish Kumar
Solving Multiagent Constraint Optimization Problems on the Constraint Composite Graph. PRIMA (2018)
Zhi Wang, Liron Cohen, Sven Koenig, T. K. Satish Kumar
The Factored Shortest Path Problem and Its Applications in Robotics. ICAPS (2018)
Guillaume Sartoretti, Justin Kerr, Yunfei Shi, Glenn Wagner, T. K. Satish Kumar, Sven Koenig, Howie Choset
PRIMAL: Pathfinding via Reinforcement and Imitation Multi-Agent Learning. CoRR (2018)
Yuan Shi, T. K. Satish Kumar, Craig A. Knoblock
Constraint-Based Learning for Sensor Failure Detection and Adaptation. ICTAI (2018)
Liron Cohen, Tansel Uras, Shiva Jahangiri, Aliyah Arunasalam, Sven Koenig, T. K. Satish Kumar
The FastMap Algorithm for Shortest Path Computations. IJCAI (2018)
Hong Xu, Kexuan Sun, Sven Koenig, T. K. Satish Kumar
A Warning Propagation-Based Linear-Time-and-Space Algorithm for the Minimum Vertex Cover Problem on Giant Graphs. CPAIOR (2018)
Liron Cohen, Matias Greco, Hang Ma, Carlos Hernández, Ariel Felner, T. K. Satish Kumar, Sven Koenig
Anytime Focal Search with Applications. IJCAI (2018)
Ferdinando Fioretto, Hong Xu, Sven Koenig, T. K. Satish Kumar
Constraint Composite Graph-Based Lifted Message Passing for Distributed Constraint Optimization Problems. ISAIM (2018)
Hong Xu, Kexuan Sun, Sven Koenig, T. K. Satish Kumar
A Warning Propagation-Based Linear-Time-and-Space Algorithm for the Minimum Vertex Cover Problem on Giant Graphs. ISAIM (2018)
Hong Xu, Cheng Cheng, Sven Koenig, T. K. Satish Kumar
Message Passing Algorithms for Semiring-Based and Valued Constraint Satisfaction Problems. SOCS (2018)
Liron Cohen, Tansel Uras, Shiva Jahangiri, Aliyah Arunasalam, Sven Koenig, T. K. Satish Kumar
The FastMap Algorithm for Shortest Path Computations. ISAIM (2018)
T. K. Satish Kumar, Zhi Wang, Anoop Kumar, Craig Milo Rogers, Craig A. Knoblock
Load Scheduling of Simple Temporal Networks Under Dynamic Resource Pricing. AAAI (2018)
Hang Ma, Glenn Wagner, Ariel Felner, Jiaoyang Li, T. K. Satish Kumar, Sven Koenig
Multi-Agent Path Finding with Deadlines: Preliminary Results. AAMAS (2018)
Wolfgang Hönig, James A. Preiss, T. K. Satish Kumar, Gaurav S. Sukhatme, Nora Ayanian
Trajectory Planning for Quadrotor Swarms. IEEE Trans. Robotics 34 (4) (2018)
Ariel Felner, Jiaoyang Li, Eli Boyarski, Hang Ma, Liron Cohen, T. K. Satish Kumar, Sven Koenig
Adding Heuristics to Conflict-Based Search for Multi-Agent Path Finding. ICAPS (2018)
Hang Ma, Glenn Wagner, Ariel Felner, Jiaoyang Li, T. K. Satish Kumar, Sven Koenig
Multi-Agent Path Finding with Deadlines: Preliminary Results. CoRR (2018)
Nitin Kamra, T. K. Satish Kumar, Nora Ayanian
Combinatorial Problems in Multirobot Battery Exchange Systems. IEEE Trans Autom. Sci. Eng. 15 (2) (2018)
Hang Ma, Glenn Wagner, Ariel Felner, Jiaoyang Li, T. K. Satish Kumar, Sven Koenig
Multi-Agent Path Finding with Deadlines. CoRR (2018)
Liron Cohen, Sven Koenig, T. K. Satish Kumar, Glenn Wagner, Howie Choset, David M. Chan, Nathan R. Sturtevant
Rapid Randomized Restarts for Multi-Agent Path Finding: Preliminary Results. AAMAS (2018)
Guillaume Sartoretti, Yue Wu, William Paivine, T. K. Satish Kumar, Sven Koenig, Howie Choset
Distributed Reinforcement Learning for Multi-robot Decentralized Collective Construction. DARS (2018)
Hong Xu, Sven Koenig, T. K. Satish Kumar
Towards Effective Deep Learning for Constraint Satisfaction Problems. CP (2018)
Hang Ma, Glenn Wagner, Ariel Felner, Jiaoyang Li, T. K. Satish Kumar, Sven Koenig
Multi-Agent Path Finding with Deadlines. IJCAI (2018)
Hang Ma, Jingxing Yang, Liron Cohen, T. K. Satish Kumar, Sven Koenig
Feasibility Study: Moving Non-Homogeneous Teams in Congested Video Game Environments. AIIDE (2017)
Hang Ma, Jiaoyang Li, T. K. Satish Kumar, Sven Koenig
Lifelong Multi-Agent Path Finding for Online Pickup and Delivery Tasks. AAMAS (2017)
Liron Cohen, T. K. Satish Kumar, Tansel Uras, Sven Koenig
The FastMap Algorithm for Shortest Path Computations. CoRR (2017)
Therese Anders, Hong Xu, Cheng Cheng, T. K. Satish Kumar
Measuring Territorial Control in Civil Wars Using Hidden Markov Models: A Data Informatics-Based Approach. CoRR (2017)
T. K. Satish Kumar, Hong Xu, Zheng Tang, Anoop Kumar, Craig Milo Rogers, Craig A. Knoblock
A Distributed Logical Filter for Connected Row Convex Constraints. ICTAI (2017)
Hang Ma, Sven Koenig, Nora Ayanian, Liron Cohen, Wolfgang Hönig, T. K. Satish Kumar, Tansel Uras, Hong Xu, Craig A. Tovey, Guni Sharon
Overview: Generalizations of Multi-Agent Path Finding to Real-World Scenarios. CoRR (2017)
Wolfgang Hönig, T. K. Satish Kumar, Liron Cohen, Hang Ma, Sven Koenig, Nora Ayanian
Path Planning with Kinematic Constraints for Robot Groups. CoRR (2017)
Wolfgang Hönig, T. K. Satish Kumar, Liron Cohen, Hang Ma, Hong Xu, Nora Ayanian, Sven Koenig
Summary: Multi-Agent Path Finding with Kinematic Constraints. IJCAI (2017)
Hong Xu, T. K. Satish Kumar, Sven Koenig
Min-Max Message Passing and Local Consistency in Constraint Networks. Australasian Conference on Artificial Intelligence (2017)
Hang Ma, Wolfgang Hönig, Liron Cohen, Tansel Uras, Hong Xu, T. K. Satish Kumar, Nora Ayanian, Sven Koenig
Overview: A Hierarchical Framework for Plan Generation and Execution in Multirobot Systems. IEEE Intell. Syst. 32 (6) (2017)
Hong Xu, T. K. Satish Kumar, Sven Koenig
A Linear-Time and Linear-Space Algorithm for the Minimum Vertex Cover Problem on Giant Graphs. SOCS (2017)
Hang Ma, T. K. Satish Kumar, Sven Koenig
Multi-Agent Path Finding with Delay Probabilities. AAAI (2017)
Hong Xu, T. K. Satish Kumar, Sven Koenig
The Nemhauser-Trotter Reduction and Lifted Message Passing for the Weighted CSP. CPAIOR (2017)
Hong Xu, Sven Koenig, T. K. Satish Kumar
A Constraint Composite Graph-Based ILP Encoding of the Boolean Weighted CSP. CP (2017)
Liron Cohen, Glenn Wagner, T. K. Satish Kumar, Howie Choset, Sven Koenig
Rapid Randomized Restarts for Multi-Agent Path Finding Solvers. CoRR (2017)

T. K. Satish Kumar.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

T. K. Satish Kumar