T. K. Satish Kumar

Proceedings of the Seventeenth International Symposium on Combinatorial Search, 2024

Map Connectivity and Empirical Hardness of Grid-based Multi-Agent Pathfinding Problem.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fourth International Conference on Automated Planning and Scheduling, 2024

Bounded-Suboptimal Weight-Constrained Shortest-Path Search via Efficient Representation of Paths.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fourth International Conference on Automated Planning and Scheduling, 2024

An Integrated Approach to Multi-Agent Scheduling with Bounded Objectives.

[BibT_eX]

[DOI]

Proceedings of the 32nd ACM International Conference on Advances in Geographic Information Systems, 2024

Constraint Composite Graph-Based Weighted CSP Solvers: An Empirical Study.

[BibT_eX]

[DOI]

Orazio Rillo

Proceedings of the Thirty-Seventh International Florida Artificial Intelligence Research Society Conference, 2024

2023

ð'3ð' : Privacy-Preserving Path Validation System for Multi-Authority Sliced Networks.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2023

Towards Effective Multi-Valued Heuristics for Bi-objective Shortest-Path Algorithms via Differential Heuristics.

[BibT_eX]

[DOI]

Proceedings of the Sixteenth International Symposium on Combinatorial Search, 2023

A FastMap-Based Framework for Efficiently Computing Top-K Projected Centrality.

[BibT_eX]

[DOI]

Proceedings of the Machine Learning, Optimization, and Data Science, 2023

A Study of Distance Functions in FastMapSVM for Classifying Seismograms.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Machine Learning and Applications, 2023

Improved Conflict-Based Search for the Virtual Network Embedding Problem.

[BibT_eX]

[DOI]

Proceedings of the 32nd International Conference on Computer Communications and Networks, 2023

Dynamic FastMap: An Efficient Algorithm for Spatiotemporal Embedding of Dynamic Graphs.

[BibT_eX]

[DOI]

Omkar Thakoor

Proceedings of the Thirty-Sixth International Florida Artificial Intelligence Research Society Conference, 2023

FastMapSVM for Predicting CSP Satisfiability.

[BibT_eX]

[DOI]

Proceedings of the 29th International Conference on Principles and Practice of Constraint Programming, 2023

Priority-Based Search for the Virtual Network Embedding Problem.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Third International Conference on Automated Planning and Scheduling, 2023

Efficient Multi-Query Bi-Objective Search via Contraction Hierarchies.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

CoRR, 2022

Multi-agent path finding with mutex propagation.

[BibT_eX]

[DOI]

Artif. Intell., 2022

Anytime Approximate Bi-Objective Search.

[BibT_eX]

[DOI]

Proceedings of the Fifteenth International Symposium on Combinatorial Search, 2022

Mutex Propagation in Multi-Agent Path Finding for Large Agents.

[BibT_eX]

[DOI]

Proceedings of the Fifteenth International Symposium on Combinatorial Search, 2022

The FastMap Pipeline for Facility Location Problems.

[BibT_eX]

[DOI]

Proceedings of the PRIMA 2022: Principles and Practice of Multi-Agent Systems, 2022

A FastMap-Based Algorithm for Block Modeling.

[BibT_eX]

[DOI]

Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2022

Trajectory Optimization for Safe Navigation in Maritime Traffic Using Historical Data.

[BibT_eX]

[DOI]

Proceedings of the 28th International Conference on Principles and Practice of Constraint Programming, 2022

FastPivot: An Algorithm for Inverse Problems.

[BibT_eX]

[DOI]

Proceedings of the 18th IEEE International Conference on Automation Science and Engineering, 2022

Conflict-Based Search for the Virtual Network Embedding Problem.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second International Conference on Automated Planning and Scheduling, 2022

A*pex: Efficient Approximate Multi-Objective Search on Graphs.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second International Conference on Automated Planning and Scheduling, 2022

2021

A Hierarchical Approach to Multi-Agent Path Finding.

[BibT_eX]

[DOI]

Proceedings of the Fourteenth International Symposium on Combinatorial Search, 2021

Hysteresis in Combinatorial Optimization Problems.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fourth International Florida Artificial Intelligence Research Society Conference, 2021

Differential Programming via OR Methods.

[BibT_eX]

[DOI]

Shannon Sweitzer

Proceedings of the 27th International Conference on Principles and Practice of Constraint Programming, 2021

Temporal Reasoning with Kinodynamic Networks.

[BibT_eX]

[DOI]

Han Zhang

Neelesh Tiruviluamala

Proceedings of the Thirty-First International Conference on Automated Planning and Scheduling, 2021

Conflict-Based Increasing Cost Search.

[BibT_eX]

[DOI]

Proceedings of the Thirty-First International Conference on Automated Planning and Scheduling, 2021

Lifelong Multi-Agent Path Finding in Large-Scale Warehouses.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020

Embedding Directed Graphs in Potential Fields Using FastMap-D.

[BibT_eX]

[DOI]

Sriram Gopalakrishnan

Liron Cohen

Proceedings of the Thirteenth International Symposium on Combinatorial Search, 2020

Decision Tree Learning-Inspired Dynamic Variable Ordering for the Weighted CSP.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth International Symposium on Combinatorial Search, 2020

Moving Agents in Formation in Congested Environments.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth International Symposium on Combinatorial Search, 2020

Mutex Propagation for SAT-based Multi-agent Path Finding.

[BibT_eX]

[DOI]

Proceedings of the PRIMA 2020: Principles and Practice of Multi-Agent Systems, 2020

Hybrid Quantum-Classical Algorithms for Solving the Weighted CSP.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2020

Generating the Top $K$ Solutions to Weighted CSPs: A Comparison of Different Approaches.

[BibT_eX]

[DOI]

Proceedings of the 32nd IEEE International Conference on Tools with Artificial Intelligence, 2020

Exact Approaches to the Multi-agent Collective Construction Problem.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2020

Idle Time Optimization for Target Assignment and Path Finding in Sortation Centers.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019

Software Adaptation for an Unmanned Undersea Vehicle.

[BibT_eX]

[DOI]

IEEE Softw., 2019

PRIMAL: Pathfinding via Reinforcement and Imitation Multi-Agent Learning.

[BibT_eX]

[DOI]

IEEE Robotics Autom. Lett., 2019

GAIA at SM-KBP 2019 - A Multi-media Multi-lingual Knowledge Extraction and Hypothesis Generation System.

[BibT_eX]

[DOI]

Proceedings of the 2019 Text Analysis Conference, 2019

Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks.

[BibT_eX]

[DOI]

Proceedings of the Twelfth International Symposium on Combinatorial Search, 2019

Optimal and Bounded-Suboptimal Multi-Agent Motion Planning.

[BibT_eX]

[DOI]

Proceedings of the Twelfth International Symposium on Combinatorial Search, 2019

Extended Abstract: Lifelong Path Planning with Kinematic Constraintsfor Multi-Agent Pickup and Delivery.

[BibT_eX]

[DOI]

Proceedings of the Twelfth International Symposium on Combinatorial Search, 2019

Automatic Adaptation to Sensor Replacements.

[BibT_eX]

[DOI]

Yuan Shi

Craig A. Knoblock

Proceedings of the Thirty-Second International Florida Artificial Intelligence Research Society Conference, 2019

Top K Hypotheses Selection on a Knowledge Graph.

[BibT_eX]

[DOI]

Kexuan Sun

Krishna Akhil Maddali

Shriraj Salian

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.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, 2019

Using FastMap to Solve Graph Problems in a Euclidean Space.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth International Conference on Automated Planning and Scheduling, 2019

Multi-agent Path Finding with Capacity Constraints.

[BibT_eX]

[DOI]

Pavel Surynek

Proceedings of the AI*IA 2019 - Advances in Artificial Intelligence, 2019

Multi-Agent Path Finding for Large Agents.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

Lifelong Path Planning with Kinematic Constraints for Multi-Agent Pickup and Delivery.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018

Trajectory Planning for Quadrotor Swarms.

[BibT_eX]

[DOI]

IEEE Trans. Robotics, 2018

Combinatorial Problems in Multirobot Battery Exchange Systems.

[BibT_eX]

[DOI]

Nitin Kamra

Nora Ayanian

IEEE Trans Autom. Sci. Eng., 2018

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

[BibT_eX]

[DOI]

CoRR, 2018

GAIA - A Multi-media Multi-lingual Knowledge Extraction and Hypothesis Generation System.

[BibT_eX]

[DOI]

Proceedings of the 2018 Text Analysis Conference, 2018

Message Passing Algorithms for Semiring-Based and Valued Constraint Satisfaction Problems.

[BibT_eX]

[DOI]

Proceedings of the Eleventh International Symposium on Combinatorial Search, 2018

Rapid Randomized Restarts for Multi-Agent Path Finding Solvers.

[BibT_eX]

[DOI]

Proceedings of the Eleventh International Symposium on Combinatorial Search, 2018

Solving Multiagent Constraint Optimization Problems on the Constraint Composite Graph.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2018

On the Linear Programming Duals of Temporal Reasoning Problems.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2018

Constraint Composite Graph-Based Lifted Message Passing for Distributed Constraint Optimization Problems.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2018

The Buss Reduction for the k-Weighted Vertex Cover Problem.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2018

The FastMap Algorithm for Shortest Path Computations.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Anytime Focal Search with Applications.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Multi-Agent Path Finding with Deadlines.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Constraint-Based Learning for Sensor Failure Detection and Adaptation.

[BibT_eX]

[DOI]

Yuan Shi

Craig A. Knoblock

Proceedings of the IEEE 30th International Conference on Tools with Artificial Intelligence, 2018

Alert Generation in Execution Monitoring Using Resource Envelopes.

[BibT_eX]

[DOI]

Proceedings of the Thirty-First International Florida Artificial Intelligence Research Society Conference, 2018

Distributed Reinforcement Learning for Multi-robot Decentralized Collective Construction.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2018

Towards Effective Deep Learning for Constraint Satisfaction Problems.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2018

Rapid Randomized Restarts for Multi-Agent Path Finding: Preliminary Results.

[BibT_eX]

[DOI]

Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, 2018

Multi-Agent Path Finding with Deadlines: Preliminary Results.

[BibT_eX]

[DOI]

Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, 2018

The Factored Shortest Path Problem and Its Applications in Robotics.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth International Conference on Automated Planning and Scheduling, 2018

Adding Heuristics to Conflict-Based Search for Multi-Agent Path Finding.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth International Conference on Automated Planning and Scheduling, 2018

Load Scheduling of Simple Temporal Networks Under Dynamic Resource Pricing.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017

Overview: A Hierarchical Framework for Plan Generation and Execution in Multirobot Systems.

[BibT_eX]

[DOI]

IEEE Intell. Syst., 2017

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

[BibT_eX]

[DOI]

CoRR, 2017

Path Planning with Kinematic Constraints for Robot Groups.

[BibT_eX]

[DOI]

CoRR, 2017

Rapid Randomized Restarts for Multi-Agent Path Finding Solvers.

[BibT_eX]

[DOI]

CoRR, 2017

The FastMap Algorithm for Shortest Path Computations.

[BibT_eX]

[DOI]

CoRR, 2017

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

[BibT_eX]

[DOI]

CoRR, 2017

A Linear-Time and Linear-Space Algorithm for the Minimum Vertex Cover Problem on Giant Graphs.

[BibT_eX]

[DOI]

Proceedings of the Tenth International Symposium on Combinatorial Search, 2017

Summary: Multi-Agent Path Finding with Kinematic Constraints.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

A Distributed Logical Filter for Connected Row Convex Constraints.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2017

Min-Max Message Passing and Local Consistency in Constraint Networks.

[BibT_eX]

[DOI]

Proceedings of the AI 2017: Advances in Artificial Intelligence, 2017

Lifelong Multi-Agent Path Finding for Online Pickup and Delivery Tasks.

[BibT_eX]

[DOI]

Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, 2017

Feasibility Study: Moving Non-Homogeneous Teams in Congested Video Game Environments.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment (AIIDE-17), 2017

Multi-Agent Path Finding with Delay Probabilities.

[BibT_eX]

[DOI]

Hang Ma

Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016

Compliant Conditions for Polynomial Time Approximation of Operator Counts.

[BibT_eX]

[DOI]

Tathagata Chakraborti

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.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2016

Formation change for robot groups in occluded environments.

[BibT_eX]

[DOI]

Proceedings of the 2016 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2016

Improved Solvers for Bounded-Suboptimal Multi-Agent Path Finding.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

SAGL: A New Heuristic for Multi-Robot Routing with Complex Tasks.

[BibT_eX]

[DOI]

Proceedings of the 28th IEEE International Conference on Tools with Artificial Intelligence, 2016

A New Solver for the Minimum Weighted Vertex Cover Problem.

[BibT_eX]

[DOI]

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).

[BibT_eX]

[DOI]

Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, 2016

Multi-Agent Path Finding with Kinematic Constraints.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth International Conference on Automated Planning and Scheduling, 2016

Planning, Scheduling and Monitoring for Airport Surface Operations.

[BibT_eX]

[DOI]

Proceedings of the Planning for Hybrid Systems, 2016

Multi-Agent Path Finding with Payload Transfers and the Package-Exchange Robot-Routing Problem.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

2014

A Tree-Based Algorithm for Construction Robots.

[BibT_eX]

[DOI]

Sangmook Johnny Jung

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.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

2013

Submodular Constraints and Planar Constraint Networks: New Results.

[BibT_eX]

[DOI]

Liron Cohen

Proceedings of the Tenth Symposium on Abstraction, Reformulation, and Approximation, 2013

Incorrect Lower Bounds for Path Consistency and More.

[BibT_eX]

[DOI]

Liron Cohen

Proceedings of the Tenth Symposium on Abstraction, Reformulation, and Approximation, 2013

On the Traveling Salesman Problem with Simple Temporal Constraints.

[BibT_eX]

[DOI]

Marcello Cirillo

Proceedings of the Tenth Symposium on Abstraction, Reformulation, and Approximation, 2013

Simple Temporal Problems with Taboo Regions.

[BibT_eX]

[DOI]

Marcello Cirillo

Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence, 2013

2008

Lifting Techniques for Weighted Constraint Satisfaction Problems.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2008

A Framework for Hybrid Tractability Results in Boolean Weighted Constraint Satisfaction Problems.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2008

CircuitTSAT: A Solver for Large Instances of the Disjunctive Temporal Problem.

[BibT_eX]

[DOI]

Blaine Nelson

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.

[BibT_eX]

[DOI]

Proceedings of the IJCAI 2007, 2007

2006

On Some Tractable Cases of Logical Filtering.

[BibT_eX]

[DOI]

Stuart Russell

Proceedings of the Sixteenth International Conference on Automated Planning and Scheduling, 2006

Tractable Classes of Metric Temporal Problems with Domain Rules.

[BibT_eX]

[DOI]

Proceedings of the Proceedings, 2006

Simple Randomized Algorithms for Tractable Row and Tree Convex Constraints.

[BibT_eX]

[DOI]

Proceedings of the Proceedings, 2006

2005

Contributions to algorithmic techniques in automated reasoning about physical systems.

[BibT_eX]

[DOI]

PhD thesis, 2005

On the Tractability of Smooth Constraint Satisfaction Problems.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the Fifteenth International Conference on Automated Planning and Scheduling (ICAPS 2005), 2005

2004

On Disjunctive Representations of Distributions and Randomization.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the Nineteenth National Conference on Artificial Intelligence, 2004

2003

Incremental Computation of Resource-Envelopes in Producer-Consumer Models.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2003

2002

The Oracular Constraints Method.

[BibT_eX]

[DOI]

Richard Dearden

Proceedings of the Abstraction, 2002

Reformulating Combinatorial Optimization as Constraint Satisfaction.

[BibT_eX]

[DOI]

Proceedings of the Abstraction, 2002

An Information-Theoretic Characterization of Abstraction in Diagnosis and Hypothesis Selection.

[BibT_eX]

[DOI]

Proceedings of the Abstraction, 2002

2000

Synergy between Compositional Modeling and Bayesian Networks.

[BibT_eX]

[DOI]

Proceedings of the Abstraction, 2000

A Compositional Approach to Causality.

[BibT_eX]

[DOI]