T. K. Satish Kumar

According to our database1, T. K. Satish Kumar authored at least 121 papers between 2000 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Caching-Augmented Lifelong Multi-Agent Path Finding.
CoRR, 2024

2023
ð'ƒ3ð'‰ : Privacy-Preserving Path Validation System for Multi-Authority Sliced Networks.
IACR Cryptol. ePrint Arch., 2023

Towards Effective Multi-Valued Heuristics for Bi-objective Shortest-Path Algorithms via Differential Heuristics.
Proceedings of the Sixteenth International Symposium on Combinatorial Search, 2023

A FastMap-Based Framework for Efficiently Computing Top-K Projected Centrality.
Proceedings of the Machine Learning, Optimization, and Data Science, 2023

A Study of Distance Functions in FastMapSVM for Classifying Seismograms.
Proceedings of the International Conference on Machine Learning and Applications, 2023

Improved Conflict-Based Search for the Virtual Network Embedding Problem.
Proceedings of the 32nd International Conference on Computer Communications and Networks, 2023

Dynamic FastMap: An Efficient Algorithm for Spatiotemporal Embedding of Dynamic Graphs.
Proceedings of the Thirty-Sixth International Florida Artificial Intelligence Research Society Conference, 2023

FastMapSVM for Predicting CSP Satisfiability.
Proceedings of the 29th International Conference on Principles and Practice of Constraint Programming, 2023

Priority-Based Search for the Virtual Network Embedding Problem.
Proceedings of the Thirty-Third International Conference on Automated Planning and Scheduling, 2023

Efficient Multi-Query Bi-Objective Search via Contraction Hierarchies.
Proceedings of the Thirty-Third International Conference on Automated Planning and Scheduling, 2023

2022
FastMapSVM: Classifying Complex Objects Using the FastMap Algorithm and Support-Vector Machines.
CoRR, 2022

Multi-agent path finding with mutex propagation.
Artif. Intell., 2022

Anytime Approximate Bi-Objective Search.
Proceedings of the Fifteenth International Symposium on Combinatorial Search, 2022

Mutex Propagation in Multi-Agent Path Finding for Large Agents.
Proceedings of the Fifteenth International Symposium on Combinatorial Search, 2022

The FastMap Pipeline for Facility Location Problems.
Proceedings of the PRIMA 2022: Principles and Practice of Multi-Agent Systems, 2022

A FastMap-Based Algorithm for Block Modeling.
Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2022

Trajectory Optimization for Safe Navigation in Maritime Traffic Using Historical Data.
Proceedings of the 28th International Conference on Principles and Practice of Constraint Programming, 2022

FastPivot: An Algorithm for Inverse Problems.
Proceedings of the 18th IEEE International Conference on Automation Science and Engineering, 2022

Conflict-Based Search for the Virtual Network Embedding Problem.
Proceedings of the Thirty-Second International Conference on Automated Planning and Scheduling, 2022

A*pex: Efficient Approximate Multi-Objective Search on Graphs.
Proceedings of the Thirty-Second International Conference on Automated Planning and Scheduling, 2022

2021
A Hierarchical Approach to Multi-Agent Path Finding.
Proceedings of the Fourteenth International Symposium on Combinatorial Search, 2021

Hysteresis in Combinatorial Optimization Problems.
Proceedings of the Thirty-Fourth International Florida Artificial Intelligence Research Society Conference, 2021

Differential Programming via OR Methods.
Proceedings of the 27th International Conference on Principles and Practice of Constraint Programming, 2021

Temporal Reasoning with Kinodynamic Networks.
Proceedings of the Thirty-First International Conference on Automated Planning and Scheduling, 2021

Conflict-Based Increasing Cost Search.
Proceedings of the Thirty-First International Conference on Automated Planning and Scheduling, 2021

Lifelong Multi-Agent Path Finding in Large-Scale Warehouses.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
Embedding Directed Graphs in Potential Fields Using FastMap-D.
Proceedings of the Thirteenth International Symposium on Combinatorial Search, 2020

Decision Tree Learning-Inspired Dynamic Variable Ordering for the Weighted CSP.
Proceedings of the Thirteenth International Symposium on Combinatorial Search, 2020

Moving Agents in Formation in Congested Environments.
Proceedings of the Thirteenth International Symposium on Combinatorial Search, 2020

Mutex Propagation for SAT-based Multi-agent Path Finding.
Proceedings of the PRIMA 2020: Principles and Practice of Multi-Agent Systems, 2020

Hybrid Quantum-Classical Algorithms for Solving the Weighted CSP.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2020

Generating the Top $K$ Solutions to Weighted CSPs: A Comparison of Different Approaches.
Proceedings of the 32nd IEEE International Conference on Tools with Artificial Intelligence, 2020

Exact Approaches to the Multi-agent Collective Construction Problem.
Proceedings of the Principles and Practice of Constraint Programming, 2020

Idle Time Optimization for Target Assignment and Path Finding in Sortation Centers.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019
Software Adaptation for an Unmanned Undersea Vehicle.
IEEE Softw., 2019

PRIMAL: Pathfinding via Reinforcement and Imitation Multi-Agent Learning.
IEEE Robotics Autom. Lett., 2019


Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks.
Proceedings of the Twelfth International Symposium on Combinatorial Search, 2019

Optimal and Bounded-Suboptimal Multi-Agent Motion Planning.
Proceedings of the Twelfth International Symposium on Combinatorial Search, 2019

Extended Abstract: Lifelong Path Planning with Kinematic Constraintsfor Multi-Agent Pickup and Delivery.
Proceedings of the Twelfth International Symposium on Combinatorial Search, 2019

Automatic Adaptation to Sensor Replacements.
Proceedings of the Thirty-Second International Florida Artificial Intelligence Research Society Conference, 2019

Top K Hypotheses Selection on a Knowledge Graph.
Proceedings of the Thirty-Second International Florida Artificial Intelligence Research Society Conference, 2019

Quadratic Reformulation of Nonlinear Pseudo-Boolean Functions via the Constraint Composite Graph.
Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2019

A New Constraint Satisfaction Perspective on Multi-Agent Path Finding: Preliminary Results.
Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, 2019

Using FastMap to Solve Graph Problems in a Euclidean Space.
Proceedings of the Twenty-Ninth International Conference on Automated Planning and Scheduling, 2019

Multi-agent Path Finding with Capacity Constraints.
Proceedings of the AI*IA 2019 - Advances in Artificial Intelligence, 2019

Multi-Agent Path Finding for Large Agents.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

Lifelong Path Planning with Kinematic Constraints for Multi-Agent Pickup and Delivery.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018
Trajectory Planning for Quadrotor Swarms.
IEEE Trans. Robotics, 2018

Combinatorial Problems in Multirobot Battery Exchange Systems.
IEEE Trans Autom. Sci. Eng., 2018

Overview: A Hierarchical Framework for Plan Generation and Execution in Multi-Robot Systems.
CoRR, 2018


Message Passing Algorithms for Semiring-Based and Valued Constraint Satisfaction Problems.
Proceedings of the Eleventh International Symposium on Combinatorial Search, 2018

Rapid Randomized Restarts for Multi-Agent Path Finding Solvers.
Proceedings of the Eleventh International Symposium on Combinatorial Search, 2018

Solving Multiagent Constraint Optimization Problems on the Constraint Composite Graph.
Proceedings of the PRIMA 2018: Principles and Practice of Multi-Agent Systems - 21st International Conference, Tokyo, Japan, October 29, 2018

Towards Understanding the Min-Sum Message Passing Algorithm for the Minimum Weighted Vertex Cover Problem: An Analytical Approach.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2018

On the Linear Programming Duals of Temporal Reasoning Problems.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2018

Constraint Composite Graph-Based Lifted Message Passing for Distributed Constraint Optimization Problems.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2018

The Buss Reduction for the k-Weighted Vertex Cover Problem.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2018

The FastMap Algorithm for Shortest Path Computations.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2018

Anytime Focal Search with Applications.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Multi-Agent Path Finding with Deadlines.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Constraint-Based Learning for Sensor Failure Detection and Adaptation.
Proceedings of the IEEE 30th International Conference on Tools with Artificial Intelligence, 2018

Alert Generation in Execution Monitoring Using Resource Envelopes.
Proceedings of the Thirty-First International Florida Artificial Intelligence Research Society Conference, 2018

Distributed Reinforcement Learning for Multi-robot Decentralized Collective Construction.
Proceedings of the Distributed Autonomous Robotic Systems, 2018

A Warning Propagation-Based Linear-Time-and-Space Algorithm for the Minimum Vertex Cover Problem on Giant Graphs.
Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2018

Towards Effective Deep Learning for Constraint Satisfaction Problems.
Proceedings of the Principles and Practice of Constraint Programming, 2018

Rapid Randomized Restarts for Multi-Agent Path Finding: Preliminary Results.
Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, 2018

Multi-Agent Path Finding with Deadlines: Preliminary Results.
Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, 2018

The Factored Shortest Path Problem and Its Applications in Robotics.
Proceedings of the Twenty-Eighth International Conference on Automated Planning and Scheduling, 2018

Adding Heuristics to Conflict-Based Search for Multi-Agent Path Finding.
Proceedings of the Twenty-Eighth International Conference on Automated Planning and Scheduling, 2018

Load Scheduling of Simple Temporal Networks Under Dynamic Resource Pricing.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017
Overview: A Hierarchical Framework for Plan Generation and Execution in Multirobot Systems.
IEEE Intell. Syst., 2017

Measuring Territorial Control in Civil Wars Using Hidden Markov Models: A Data Informatics-Based Approach.
CoRR, 2017

Path Planning with Kinematic Constraints for Robot Groups.
CoRR, 2017

Rapid Randomized Restarts for Multi-Agent Path Finding Solvers.
CoRR, 2017

The FastMap Algorithm for Shortest Path Computations.
CoRR, 2017

Overview: Generalizations of Multi-Agent Path Finding to Real-World Scenarios.
CoRR, 2017

A Linear-Time and Linear-Space Algorithm for the Minimum Vertex Cover Problem on Giant Graphs.
Proceedings of the Tenth International Symposium on Combinatorial Search, 2017

Summary: Multi-Agent Path Finding with Kinematic Constraints.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

A Distributed Logical Filter for Connected Row Convex Constraints.
Proceedings of the 29th IEEE International Conference on Tools with Artificial Intelligence, 2017

The Nemhauser-Trotter Reduction and Lifted Message Passing for the Weighted CSP.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2017

A Constraint Composite Graph-Based ILP Encoding of the Boolean Weighted CSP.
Proceedings of the Principles and Practice of Constraint Programming, 2017

Min-Max Message Passing and Local Consistency in Constraint Networks.
Proceedings of the AI 2017: Advances in Artificial Intelligence, 2017

Lifelong Multi-Agent Path Finding for Online Pickup and Delivery Tasks.
Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, 2017

Feasibility Study: Moving Non-Homogeneous Teams in Congested Video Game Environments.
Proceedings of the Thirteenth AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment (AIIDE-17), 2017

Multi-Agent Path Finding with Delay Probabilities.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016
Compliant Conditions for Polynomial Time Approximation of Operator Counts.
Proceedings of the Ninth Annual Symposium on Combinatorial Search, 2016

Kernelization, Generation of Bounds, and the Scope of Incremental Computation for Weighted Constraint Satisfaction Problems.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2016

Formation change for robot groups in occluded environments.
Proceedings of the 2016 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2016

Improved Solvers for Bounded-Suboptimal Multi-Agent Path Finding.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

SAGL: A New Heuristic for Multi-Robot Routing with Complex Tasks.
Proceedings of the 28th IEEE International Conference on Tools with Artificial Intelligence, 2016

A New Solver for the Minimum Weighted Vertex Cover Problem.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2016

Local Search on Trees and a Framework for Automated Construction Using Multiple Identical Robots: (Extended Abstract).
Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, 2016

Multi-Agent Path Finding with Kinematic Constraints.
Proceedings of the Twenty-Sixth International Conference on Automated Planning and Scheduling, 2016

Planning, Scheduling and Monitoring for Airport Surface Operations.
Proceedings of the Planning for Hybrid Systems, 2016

Multi-Agent Path Finding with Payload Transfers and the Package-Exchange Robot-Routing Problem.
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

2014
A Tree-Based Algorithm for Construction Robots.
Proceedings of the Twenty-Fourth International Conference on Automated Planning and Scheduling, 2014

A Simple Polynomial-Time Randomized Distributed Algorithm for Connected Row Convex Constraints.
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

2013
Submodular Constraints and Planar Constraint Networks: New Results.
Proceedings of the Tenth Symposium on Abstraction, Reformulation, and Approximation, 2013

Incorrect Lower Bounds for Path Consistency and More.
Proceedings of the Tenth Symposium on Abstraction, Reformulation, and Approximation, 2013

On the Traveling Salesman Problem with Simple Temporal Constraints.
Proceedings of the Tenth Symposium on Abstraction, Reformulation, and Approximation, 2013

Simple Temporal Problems with Taboo Regions.
Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence, 2013

2008
Lifting Techniques for Weighted Constraint Satisfaction Problems.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2008

A Framework for Hybrid Tractability Results in Boolean Weighted Constraint Satisfaction Problems.
Proceedings of the Principles and Practice of Constraint Programming, 2008

CircuitTSAT: A Solver for Large Instances of the Disjunctive Temporal Problem.
Proceedings of the Eighteenth International Conference on Automated Planning and Scheduling, 2008

2007
Fast (Incremental) Algorithms for Useful Classes of Simple Temporal Problems with Preferences.
Proceedings of the IJCAI 2007, 2007

2006
On Some Tractable Cases of Logical Filtering.
Proceedings of the Sixteenth International Conference on Automated Planning and Scheduling, 2006

Tractable Classes of Metric Temporal Problems with Domain Rules.
Proceedings of the Proceedings, 2006

Simple Randomized Algorithms for Tractable Row and Tree Convex Constraints.
Proceedings of the Proceedings, 2006

2005
Contributions to algorithmic techniques in automated reasoning about physical systems.
PhD thesis, 2005

On the Tractability of Smooth Constraint Satisfaction Problems.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2005

On the Tractability of Restricted Disjunctive Temporal Problems.
Proceedings of the Fifteenth International Conference on Automated Planning and Scheduling (ICAPS 2005), 2005

2004
On Disjunctive Representations of Distributions and Randomization.
Proceedings of the Research and Development in Intelligent Systems XXI, 2004

A Polynomial-Time Algorithm for Simple Temporal Problems with Piecewise Constant Domain Preference Functions.
Proceedings of the Nineteenth National Conference on Artificial Intelligence, 2004

2003
Incremental Computation of Resource-Envelopes in Producer-Consumer Models.
Proceedings of the Principles and Practice of Constraint Programming, 2003

2002
The Oracular Constraints Method.
Proceedings of the Abstraction, 2002

Reformulating Combinatorial Optimization as Constraint Satisfaction.
Proceedings of the Abstraction, 2002

An Information-Theoretic Characterization of Abstraction in Diagnosis and Hypothesis Selection.
Proceedings of the Abstraction, 2002

2000
Synergy between Compositional Modeling and Bayesian Networks.
Proceedings of the Abstraction, 2000

A Compositional Approach to Causality.
Proceedings of the Abstraction, 2000


  Loading...