default search action
T. K. Satish Kumar
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [c115]Orazio Rillo, T. K. Satish Kumar:
Constraint Composite Graph-Based Weighted CSP Solvers: An Empirical Study. FLAIRS 2024 - [c114]Fandel Lin
, Han Zhang
An Integrated Approach to Multi-Agent Scheduling with Bounded Objectives. SIGSPATIAL/GIS 2024: 493-496 - [c113]Jingyao Ren, Eric Ewing, T. K. Satish Kumar, Sven Koenig, Nora Ayanian:
Map Connectivity and Empirical Hardness of Grid-based Multi-Agent Pathfinding Problem. ICAPS 2024: 484-488 - [c112]Han Zhang, Oren Salzman, Ariel Felner, T. K. Satish Kumar, Sven Koenig:
Bounded-Suboptimal Weight-Constrained Shortest-Path Search via Efficient Representation of Paths. ICAPS 2024: 680-688 - [c111]Ang Li, Peter J. Stuckey, Sven Koenig, T. K. Satish Kumar:
Solving Facility Location Problems via FastMap and Locality Sensitive Hashing. SOCS 2024: 46-54 - [c110]Han Zhang, Oren Salzman, Ariel Felner, T. K. Satish Kumar, Carlos Hernández Ulloa, Sven Koenig:
Speeding Up Dominance Checks in Multi-Objective Search: New Techniques and Data Structures. SOCS 2024: 228-232 - [i24]Yimin Tang, Zhenghong Yu, Yi Zheng, T. K. Satish Kumar, Jiaoyang Li, Sven Koenig:
Caching-Augmented Lifelong Multi-Agent Path Finding. CoRR abs/2403.13421 (2024) - 2023
- [c109]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: 452-461 - [c108]Yi Zheng
Priority-Based Search for the Virtual Network Embedding Problem. ICAPS 2023: 472-480 - [c107]Kexin Zheng, Ang Li, Han Zhang, T. K. Satish Kumar:
FastMapSVM for Predicting CSP Satisfiability. CP 2023: 40:1-40:17 - [c106]Omkar Thakoor, T. K. Satish Kumar:
Dynamic FastMap: An Efficient Algorithm for Spatiotemporal Embedding of Dynamic Graphs. FLAIRS 2023 - [c105]Yi Zheng
Improved Conflict-Based Search for the Virtual Network Embedding Problem. ICCCN 2023: 1-10 - [c104]Kushal Sharma, Ang Li, Malcolm C. A. White, T. K. Satish Kumar:
A Study of Distance Functions in FastMapSVM for Classifying Seismograms. ICMLA 2023: 1963-1970 - [c103]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: 158-173 - [c102]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: 101-109 - [i23]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: 53 (2023) - 2022
- [j6]Han Zhang
Multi-agent path finding with mutex propagation. Artif. Intell. 311: 103766 (2022) - [c101]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: 394-403 - [c100]Yi Zheng, Srivatsan Ravi
Conflict-Based Search for the Virtual Network Embedding Problem. ICAPS 2022: 423-433 - [c99]Yuling Guan, Ang Li, Sven Koenig, Stephan Haas, T. K. Satish Kumar:
FastPivot: An Algorithm for Inverse Problems. CASE 2022: 505-511 - [c98]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: 5:1-5:17 - [c97]Ang Li, Peter J. Stuckey, Sven Koenig, T. K. Satish Kumar:
A FastMap-Based Algorithm for Block Modeling. CPAIOR 2022: 232-248 - [c96]Omkar Thakoor, Ang Li, Sven Koenig, Srivatsan Ravi, Erik Kline, T. K. Satish Kumar:
The FastMap Pipeline for Facility Location Problems. PRIMA 2022: 417-434 - [c95]Han Zhang, Oren Salzman, T. K. Satish Kumar, Ariel Felner, Carlos Hernández Ulloa, Sven Koenig:
Anytime Approximate Bi-Objective Search. SOCS 2022: 199-207 - [c94]Han Zhang, Yutong Li, Jiaoyang Li, T. K. Satish Kumar, Sven Koenig:
Mutex Propagation in Multi-Agent Path Finding for Large Agents. SOCS 2022: 249-253 - [i22]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 abs/2204.05112 (2022) - 2021
- [c93]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: 11272-11281 - [c92]Thayne T. Walker, Nathan R. Sturtevant, Ariel Felner, Han Zhang, Jiaoyang Li, T. K. Satish Kumar:
Conflict-Based Increasing Cost Search. ICAPS 2021: 385-395 - [c91]Han Zhang, Neelesh Tiruviluamala, Sven Koenig, T. K. Satish Kumar:
Temporal Reasoning with Kinodynamic Networks. ICAPS 2021: 415-425 - [c90]Shannon Sweitzer, T. K. Satish Kumar:
Differential Programming via OR Methods. CP 2021: 53:1-53:15 - [c89]Yuling Guan, Ang Li, Sven Koenig, Stephan Haas, T. K. Satish Kumar:
Hysteresis in Combinatorial Optimization Problems. FLAIRS 2021 - [c88]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: 209-211 - 2020
- [c87]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: 9925-9932 - [c86]Han Zhang, Jiaoyang Li, Pavel Surynek, Sven Koenig, T. K. Satish Kumar:
Multi-Agent Path Finding with Mutex Propagation. ICAPS 2020: 323-332 - [c85]Jiaoyang Li, Kexuan Sun, Hang Ma, Ariel Felner, T. K. Satish Kumar, Sven Koenig:
Moving Agents in Formation in Congested Environments. AAMAS 2020: 726-734 - [c84]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: 1898-1900 - [c83]Edward Lam
Exact Approaches to the Multi-agent Collective Construction Problem. CP 2020: 743-758 - [c82]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: 1218-1223 - [c81]Hong Xu, Kexuan Sun, Sven Koenig, Itay Hen, T. K. Satish Kumar:
Hybrid Quantum-Classical Algorithms for Solving the Weighted CSP. ISAIM 2020 - [c80]Pavel Surynek
Mutex Propagation for SAT-based Multi-agent Path Finding. PRIMA 2020: 248-258 - [c79]Sriram Gopalakrishnan, Liron Cohen, Sven Koenig, T. K. Satish Kumar:
Embedding Directed Graphs in Potential Fields Using FastMap-D. SOCS 2020: 48-56 - [c78]Hong Xu, Kexuan Sun, Sven Koenig, T. K. Satish Kumar:
Decision Tree Learning-Inspired Dynamic Variable Ordering for the Weighted CSP. SOCS 2020: 91-99 - [c77]Jiaoyang Li, Kexuan Sun, Hang Ma, Ariel Felner, T. K. Satish Kumar, Sven Koenig:
Moving Agents in Formation in Congested Environments. SOCS 2020: 131-132 - [i21]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 abs/2005.07371 (2020) - [i20]Sriram Gopalakrishnan, Liron Cohen, Sven Koenig, T. K. Satish Kumar:
Embedding Directed Graphs in Potential Fields Using FastMap-D. CoRR abs/2006.03112 (2020)
2010 – 2019
- 2019
- [j5]Guillaume Sartoretti
PRIMAL: Pathfinding via Reinforcement and Imitation Multi-Agent Learning. IEEE Robotics Autom. Lett. 4(3): 2378-2385 (2019) - [j4]Avi Pfeffer
Software Adaptation for an Unmanned Undersea Vehicle. IEEE Softw. 36(2): 91-96 (2019) - [c76]Jiaoyang Li, Pavel Surynek
Multi-Agent Path Finding for Large Agents. AAAI 2019: 7627-7634 - [c75]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: 7651-7658 - [c74]Pavel Surynek
Multi-agent Path Finding with Capacity Constraints. AI*IA 2019: 235-249 - [c73]Jiaoyang Li, Ariel Felner, Sven Koenig, T. K. Satish Kumar:
Using FastMap to Solve Graph Problems in a Euclidean Space. ICAPS 2019: 273-278 - [c72]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: 2253-2255 - [c71]Ka Wa Yip
Quadratic Reformulation of Nonlinear Pseudo-Boolean Functions via the Constraint Composite Graph. CPAIOR 2019: 643-660 - [c70]Yuan Shi, T. K. Satish Kumar, Craig A. Knoblock:
Automatic Adaptation to Sensor Replacements. FLAIRS 2019: 68-73 - [c69]Kexuan Sun, Krishna Akhil Maddali, Shriraj Salian, T. K. Satish Kumar:
Top K Hypotheses Selection on a Knowledge Graph. FLAIRS 2019: 136-139 - [c68]Liron Cohen, Tansel Uras, T. K. Satish Kumar, Sven Koenig:
Optimal and Bounded-Suboptimal Multi-Agent Motion Planning. SOCS 2019: 44-51 - [c67]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: 151-158 - [c66]Jiaoyang Li, Pavel Surynek, Ariel Felner, Hang Ma, T. K. Satish Kumar, Sven Koenig:
Multi-Agent Path Finding for Large Agents. SOCS 2019: 186-187 - [c65]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: 190-191 - [i19]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 - [i18]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 abs/1906.08291 (2019) - [i17]Pavel Surynek, T. K. Satish Kumar, Sven Koenig:
Multi-Agent Path Finding with Capacity Constraints. CoRR abs/1907.12648 (2019) - [i16]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 abs/1912.00253 (2019) - 2018
- [j3]Nitin Kamra
Combinatorial Problems in Multirobot Battery Exchange Systems. IEEE Trans Autom. Sci. Eng. 15(2): 852-862 (2018) - [j2]Wolfgang Hönig
Trajectory Planning for Quadrotor Swarms. IEEE Trans. Robotics 34(4): 856-869 (2018) - [c64]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: 6227-6236 - [c63]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: 83-87 - [c62]Zhi Wang, Liron Cohen, Sven Koenig, T. K. Satish Kumar:
The Factored Shortest Path Problem and Its Applications in Robotics. ICAPS 2018: 527-531 - [c61]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: 1909-1911 - [c60]Hang Ma, Glenn Wagner, Ariel Felner, Jiaoyang Li, T. K. Satish Kumar, Sven Koenig:
Multi-Agent Path Finding with Deadlines: Preliminary Results. AAMAS 2018: 2004-2006 - [c59]Hong Xu
Towards Effective Deep Learning for Constraint Satisfaction Problems. CP 2018: 588-597 - [c58]Hong Xu
A Warning Propagation-Based Linear-Time-and-Space Algorithm for the Minimum Vertex Cover Problem on Giant Graphs. CPAIOR 2018: 567-584 - [c57]Guillaume Sartoretti
Distributed Reinforcement Learning for Multi-robot Decentralized Collective Construction. DARS 2018: 35-49 - [c56]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 2018: 38-43 - [c55]Yuan Shi, T. K. Satish Kumar, Craig A. Knoblock:
Constraint-Based Learning for Sensor Failure Detection and Adaptation. ICTAI 2018: 328-335 - [c54]Hang Ma, Glenn Wagner, Ariel Felner, Jiaoyang Li, T. K. Satish Kumar, Sven Koenig:
Multi-Agent Path Finding with Deadlines. IJCAI 2018: 417-423 - [c53]Liron Cohen, Tansel Uras, Shiva Jahangiri
The FastMap Algorithm for Shortest Path Computations. IJCAI 2018: 1427-1433 - [c52]Liron Cohen, Matias Greco
Anytime Focal Search with Applications. IJCAI 2018: 1434-1441 - [c51]Liron Cohen, Tansel Uras, Shiva Jahangiri, Aliyah Arunasalam, Sven Koenig, T. K. Satish Kumar:
The FastMap Algorithm for Shortest Path Computations. ISAIM 2018 - [c50]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 - [c49]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 - [c48]Ferdinando Fioretto, Hong Xu, Sven Koenig, T. K. Satish Kumar:
Constraint Composite Graph-Based Lifted Message Passing for Distributed Constraint Optimization Problems. ISAIM 2018 - [c47]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 - [c46]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 - [c45]Ferdinando Fioretto
Solving Multiagent Constraint Optimization Problems on the Constraint Composite Graph. PRIMA 2018: 106-122 - [c44]Hong Xu, Cheng Cheng, Sven Koenig, T. K. Satish Kumar:
Message Passing Algorithms for Semiring-Based and Valued Constraint Satisfaction Problems. SOCS 2018: 115-123 - [c43]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: 148-152 - [i15]Tongtao Zhang, Ananya Subburathinam, Ge Shi, Lifu Huang, Di Lu, Xiaoman Pan, Manling Li, Boliang Zhang, Qingyun Wang
GAIA - A Multi-media Multi-lingual Knowledge Extraction and Hypothesis Generation System. TAC 2018 - [i14]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 abs/1804.00038 (2018) - [i13]Hang Ma, Glenn Wagner, Ariel Felner, Jiaoyang Li, T. K. Satish Kumar, Sven Koenig:
Multi-Agent Path Finding with Deadlines: Preliminary Results. CoRR abs/1805.04961 (2018) - [i12]Hang Ma, Glenn Wagner, Ariel Felner, Jiaoyang Li, T. K. Satish Kumar, Sven Koenig:
Multi-Agent Path Finding with Deadlines. CoRR abs/1806.04216 (2018) - [i11]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 abs/1809.03531 (2018) - [i10]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 abs/1812.06355 (2018) - 2017
- [j1]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): 6-12 (2017) - [c42]Hang Ma, T. K. Satish Kumar, Sven Koenig:
Multi-Agent Path Finding with Delay Probabilities. AAAI 2017: 3605-3612 - [c41]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: 270-272 - [c40]Hang Ma, Jiaoyang Li, T. K. Satish Kumar, Sven Koenig:
Lifelong Multi-Agent Path Finding for Online Pickup and Delivery Tasks. AAMAS 2017: 837-845 - [c39]Hong Xu
Min-Max Message Passing and Local Consistency in Constraint Networks. Australasian Conference on Artificial Intelligence 2017: 340-352 - [c38]Hong Xu
A Constraint Composite Graph-Based ILP Encoding of the Boolean Weighted CSP. CP 2017: 630-638 - [c37]Hong Xu
The Nemhauser-Trotter Reduction and Lifted Message Passing for the Weighted CSP. CPAIOR 2017: 387-402 - [c36]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: 96-101 - [c35]Wolfgang Hönig, T. K. Satish Kumar, Liron Cohen, Hang Ma
Summary: Multi-Agent Path Finding with Kinematic Constraints. IJCAI 2017: 4869-4873 - [c34]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: 173-174 - [i9]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 abs/1702.05515 (2017) - [i8]Wolfgang Hönig, T. K. Satish Kumar, Liron Cohen, Hang Ma, Sven Koenig, Nora Ayanian:
Path Planning with Kinematic Constraints for Robot Groups. CoRR abs/1704.07538 (2017) - [i7]Hang Ma, Jiaoyang Li, T. K. Satish Kumar, Sven Koenig:
Lifelong Multi-Agent Path Finding for Online Pickup and Delivery Tasks. CoRR abs/1705.10868 (2017) - [i6]Liron Cohen, T. K. Satish Kumar, Tansel Uras, Sven Koenig:
The FastMap Algorithm for Shortest Path Computations. CoRR abs/1706.02792 (2017) - [i5]Liron Cohen, Glenn Wagner, T. K. Satish Kumar, Howie Choset, Sven Koenig:
Rapid Randomized Restarts for Multi-Agent Path Finding Solvers. CoRR abs/1706.02794 (2017) - [i4]Hang Ma, Jingxing Yang, Liron Cohen, T. K. Satish Kumar, Sven Koenig:
Feasibility Study: Moving Non-Homogeneous Teams in Congested Video Game Environments. CoRR abs/1710.01447 (2017) - [i3]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 abs/1711.06786 (2017) - 2016
- [c33]Hang Ma, Craig A. Tovey, Guni Sharon, T. K. Satish Kumar, Sven Koenig:
Multi-Agent Path Finding with Payload Transfers and the Package-Exchange Robot-Routing Problem. AAAI 2016: 3166-3173 - [c32]Robert Morris, Corina S. Pasareanu, Kasper Søe Luckow, Waqar Malik, Hang Ma, T. K. Satish Kumar, Sven Koenig:
Planning, Scheduling and Monitoring for Airport Surface Operations. AAAI Workshop: Planning for Hybrid Systems 2016 - [c31]Wolfgang Hönig, T. K. Satish Kumar, Liron Cohen, Hang Ma, Hong Xu, Nora Ayanian, Sven Koenig:
Multi-Agent Path Finding with Kinematic Constraints. ICAPS 2016: 477-485 - [c30]Trevor Cai, David Y. Zhang, T. K. Satish Kumar, Sven Koenig, Nora Ayanian:
Local Search on Trees and a Framework for Automated Construction Using Multiple Identical Robots: (Extended Abstract). AAMAS 2016: 1301-1302 - [c29]Hong Xu
A New Solver for the Minimum Weighted Vertex Cover Problem. CPAIOR 2016: 392-405 - [c28]Hong Xu
SAGL: A New Heuristic for Multi-Robot Routing with Complex Tasks. ICTAI 2016: 530-535 - [c27]Liron Cohen, Tansel Uras, T. K. Satish Kumar, Hong Xu, Nora Ayanian, Sven Koenig:
Improved Solvers for Bounded-Suboptimal Multi-Agent Path Finding. IJCAI 2016: 3067-3074 - [c26]Wolfgang Hönig, T. K. Satish Kumar, Hang Ma
Formation change for robot groups in occluded environments. IROS 2016: 4836-4842 - [c25]T. K. Satish Kumar:
Kernelization, Generation of Bounds, and the Scope of Incremental Computation for Weighted Constraint Satisfaction Problems. ISAIM 2016 - [c24]Tathagata Chakraborti, Sarath Sreedharan, Sailik Sengupta, T. K. Satish Kumar, Subbarao Kambhampati:
Compliant Conditions for Polynomial Time Approximation of Operator Counts. SOCS 2016: 123-124 - [i2]Tathagata Chakraborti, Sarath Sreedharan, Sailik Sengupta, T. K. Satish Kumar, Subbarao Kambhampati:
Compliant Conditions for Polynomial Time Approximation of Operator Counts. CoRR abs/1605.07989 (2016) - [i1]Hang Ma, T. K. Satish Kumar, Sven Koenig:
Multi-Agent Path Finding with Delay Probabilities. CoRR abs/1612.05309 (2016) - 2014
- [c23]T. K. Satish Kumar, Duc Thien Nguyen, William Yeoh, Sven Koenig:
A Simple Polynomial-Time Randomized Distributed Algorithm for Connected Row Convex Constraints. AAAI 2014: 2308-2314 - [c22]T. K. Satish Kumar, Sangmook Johnny Jung, Sven Koenig:
A Tree-Based Algorithm for Construction Robots. ICAPS 2014 - 2013
- [c21]T. K. Satish Kumar, Marcello Cirillo, Sven Koenig:
Simple Temporal Problems with Taboo Regions. AAAI 2013: 548-554 - [c20]T. K. Satish Kumar, Marcello Cirillo, Sven Koenig:
On the Traveling Salesman Problem with Simple Temporal Constraints. SARA 2013 - [c19]T. K. Satish Kumar, Liron Cohen, Sven Koenig:
Incorrect Lower Bounds for Path Consistency and More. SARA 2013 - [c18]T. K. Satish Kumar, Liron Cohen, Sven Koenig:
Submodular Constraints and Planar Constraint Networks: New Results. SARA 2013
2000 – 2009
- 2008
- [c17]Blaine Nelson, T. K. Satish Kumar:
CircuitTSAT: A Solver for Large Instances of the Disjunctive Temporal Problem. ICAPS 2008: 232-239 - [c16]T. K. Satish Kumar:
A Framework for Hybrid Tractability Results in Boolean Weighted Constraint Satisfaction Problems. CP 2008: 282-297 - [c15]T. K. Satish Kumar:
Lifting Techniques for Weighted Constraint Satisfaction Problems. ISAIM 2008 - 2007
- [c14]T. K. Satish Kumar:
Fast (Incremental) Algorithms for Useful Classes of Simple Temporal Problems with Preferences. IJCAI 2007: 1954-1959 - 2006
- [c13]T. K. Satish Kumar:
Simple Randomized Algorithms for Tractable Row and Tree Convex Constraints. AAAI 2006: 74-79 - [c12]T. K. Satish Kumar:
Tractable Classes of Metric Temporal Problems with Domain Rules. AAAI 2006: 847-852 - [c11]T. K. Satish Kumar, Stuart Russell:
On Some Tractable Cases of Logical Filtering. ICAPS 2006: 83-92 - 2005
- [b1]T. K. Satish Kumar:
Contributions to algorithmic techniques in automated reasoning about physical systems. Stanford University, USA, 2005 - [c10]T. K. Satish Kumar:
On the Tractability of Restricted Disjunctive Temporal Problems. ICAPS 2005: 110-119 - [c9]T. K. Satish Kumar:
On the Tractability of Smooth Constraint Satisfaction Problems. CPAIOR 2005: 304-319 - 2004
- [c8]T. K. Satish Kumar:
A Polynomial-Time Algorithm for Simple Temporal Problems with Piecewise Constant Domain Preference Functions. AAAI 2004: 67-72 - [c7]T. K. Satish Kumar:
On Disjunctive Representations of Distributions and Randomization. SGAI Conf. 2004: 327-340 - 2003
- [c6]T. K. Satish Kumar:
Incremental Computation of Resource-Envelopes in Producer-Consumer Models. CP 2003: 664-678 - 2002
- [c5]T. K. Satish Kumar:
An Information-Theoretic Characterization of Abstraction in Diagnosis and Hypothesis Selection. SARA 2002: 126-139 - [c4]T. K. Satish Kumar, Richard Dearden:
The Oracular Constraints Method. SARA 2002: 290-298 - [c3]T. K. Satish Kumar:
Reformulating Combinatorial Optimization as Constraint Satisfaction. SARA 2002: 336-337 - 2000
- [c2]T. K. Satish Kumar:
A Compositional Approach to Causality. SARA 2000: 309-312 - [c1]T. K. Satish Kumar:
Synergy between Compositional Modeling and Bayesian Networks. SARA 2000: 324-325
Coauthor Index
[c113] [c112] [c111] [c110] [i24] [c109] [c108] [c105] [c103] [c102] [j6] [c101] [c100] [c99] [c97] [c96] [c95] [c94] [c93] [c91] [c89] [c88] [c87] [c86] [c85] [c84] [c83] [c82] [c81] [c80] [c79] [c78] [c77] [i21] [i20] [j5] [c76] [c75] [c74] [c73] [c72] [c71] [c68] [c67] [c66] [c65] [i18] [i17] [i16] [c63] [c62] [c61] [c60] [c59] [c58] [c57] [c54] [c53] [c52] [c51] [c50] [c49] [c48] [c46] [c45] [c44] [c43] [i14] [i13] [i12] [i11] [i10] [j1] [c42] [c41] [c40] [c39] [c38] [c37] [c35] [c34] [i9] [i8] [i7] [i6] [i5] [i4] [c33] [c32] [c31] [c30] [c29] [c28] [c27] [c26] [i1] [c23] [c22] [c21] [c20] [c19] [c18]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-03 20:31 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: