Pavel Surynek

Proceedings of the Seventeenth International Symposium on Combinatorial Search, 2024

Spectral Clustering in Rule-based Algorithms for Multi-agent Path Finding (Extended Abstract).

[BibT_eX]

[DOI]

Irene Saccani

Proceedings of the Seventeenth International Symposium on Combinatorial Search, 2024

Action Duration Generalization for Exact Multi-Agent Collective Construction.

[BibT_eX]

[DOI]

Martin Rames

Proceedings of the 16th International Conference on Agents and Artificial Intelligence, 2024

Multi-Agent Path Finding with Continuous Time Using SAT Modulo Linear Real Arithmetic.

[BibT_eX]

[DOI]

Tomás Kolárik

Stefan Ratschan

Proceedings of the 16th International Conference on Agents and Artificial Intelligence, 2024

2023

Agent-Based Modeling in Hierarchical Control of Swarms During Evacuation.

[BibT_eX]

[DOI]

SN Comput. Sci., 2023

Counterexample Guided Abstraction Refinement with Non-Refined Abstractions for Multi-Agent Path Finding.

[BibT_eX]

[DOI]

CoRR, 2023

Multi-agent Path Finding for Indoor Quadcopters.

[BibT_eX]

[DOI]

Matous Kulhan

Proceedings of the Advances in Practical Applications of Agents, Multi-Agent Systems, and Cognitive Mimetics. The PAAMS Collection, 2023

Counterexample Guided Abstraction Refinement with Non-Refined Abstractions for Multi-Goal Multi-Robot Path Planning.

[BibT_eX]

[DOI]

IROS, 2023

Non-Refined Abstractions in Counterexample Guided Abstraction Refinement for Multi-Agent Path Finding.

[BibT_eX]

[DOI]

Proceedings of the 35th IEEE International Conference on Tools with Artificial Intelligence, 2023

Spectral Clustering in Rule-Based Algorithms for Multi-Agent Path Finding.

[BibT_eX]

[DOI]

Irene Saccani

Proceedings of the 20th International Conference on Informatics in Control, 2023

Multi-Agent Pathfinding for Indoor Quadcopters: A Platform for Testing Planning-Acting Loop.

[BibT_eX]

[DOI]

Matous Kulhan

Proceedings of the 20th International Conference on Informatics in Control, 2023

Candidate Path Selection Heuristics for Multi-Agent Path Finding: A Novel Compilation-Based Method.

[BibT_eX]

[DOI]

Proceedings of the 15th International Conference on Agents and Artificial Intelligence, 2023

2022

Migrating Techniques from Search-based Multi-Agent Path Finding Solvers to SAT-based Approach.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2022

Heuristically Guided Compilation for Multi-Agent Path Finding.

[BibT_eX]

[DOI]

CoRR, 2022

Plan Execution for Multi-Agent Path Finding with Indoor Quadcopters.

[BibT_eX]

[DOI]

Matous Kulhan

CoRR, 2022

Multi-agent path finding with mutex propagation.

[BibT_eX]

[DOI]

Artif. Intell., 2022

Multi-agent pathfinding with continuous time.

[BibT_eX]

[DOI]

Anton Andreychuk

Konstantin S. Yakovlev

Dor Atzmon

Roni Stern

Artif. Intell., 2022

Sparse Decision Diagrams for SAT-based Compilation of Multi-Agent Path Finding (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Fifteenth International Symposium on Combinatorial Search, 2022

Combining Conflict-based Search and Agent-based Modeling for Evacuation Problems (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Fifteenth International Symposium on Combinatorial Search, 2022

Lazy Compilation in Classical Planning (Extended Abstract).

[BibT_eX]

[DOI]

Zuzana Fílová

Proceedings of the Fifteenth International Symposium on Combinatorial Search, 2022

Problem Compilation for Multi-Agent Path Finding: a Survey.

[BibT_eX]

[DOI]

Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

Highways in Warehouse Multi-Agent Path Finding: A Case Study.

[BibT_eX]

[DOI]

Vojtech Rybár

Proceedings of the 14th International Conference on Agents and Artificial Intelligence, 2022

Domain Dependent Parameter Setting in SAT Solver Using Machine Learning Techniques.

[BibT_eX]

[DOI]

Filip Beskyd

Proceedings of the Agents and Artificial Intelligence - 14th International Conference, 2022

Parameter Setting in SAT Solver using Machine Learning Techniques.

[BibT_eX]

[DOI]

Filip Beskyd

Proceedings of the 14th International Conference on Agents and Artificial Intelligence, 2022

2021

Compilation-based Solvers for Multi-Agent Path Finding: a Survey, Discussion, and Future Opportunities.

[BibT_eX]

[DOI]

CoRR, 2021

Conceptual Comparison of Compilation-based Solvers for Multi-Agent Path Finding: MIP vs. SAT.

[BibT_eX]

[DOI]

Proceedings of the Fourteenth International Symposium on Combinatorial Search, 2021

Sum of Costs Optimal Multi-Agent Path Finding with Continuous Time via Satisfiability Modulo Theories.

[BibT_eX]

[DOI]

Proceedings of the Fourteenth International Symposium on Combinatorial Search, 2021

DPLL(MAPF): an Integration of Multi-Agent Path Finding and SAT Solving Technologies.

[BibT_eX]

[DOI]

Martin Capek

Proceedings of the Fourteenth International Symposium on Combinatorial Search, 2021

Sparsification for Fast Optimal Multi-Robot Path Planning in Lazy Compilation Schemes.

[BibT_eX]

[DOI]

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

Sparse Real-time Decision Diagrams for Continuous Multi-Robot Path Planning.

[BibT_eX]

[DOI]

Proceedings of the 33rd IEEE International Conference on Tools with Artificial Intelligence, 2021

Adversarial Multi-Agent Path Finding is Intractable.

[BibT_eX]

[DOI]

Proceedings of the 33rd IEEE International Conference on Tools with Artificial Intelligence, 2021

Hierarchical Control of Swarms during Evacuation.

[BibT_eX]

[DOI]

Proceedings of the 13th International Joint Conference on Knowledge Discovery, 2021

Multi-Goal Multi-Agent Path Finding via Decoupled and Integrated Goal Vertex Ordering.

[BibT_eX]

[DOI]

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

ESO-MAPF: Bridging Discrete Planning and Continuous Execution in Multi-Agent Pathfinding.

[BibT_eX]

[DOI]

Ján Chudý

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

2020

Pushing the Envelope: From Discrete to Continuous Movements in Multi-Agent Path Finding via Lazy Encodings.

[BibT_eX]

[DOI]

CoRR, 2020

Swarms of Mobile Agents: From Discrete to Continuous Movements in Multi-Agent Path Finding.

[BibT_eX]

[DOI]

Proceedings of the 2020 IEEE International Conference on Systems, Man, and Cybernetics, 2020

Emulating Centralized Control in Multi-Agent Pathfinding Using Decentralized Swarm of Reflex-Based Robots.

[BibT_eX]

[DOI]

Ján Chudý

Nestor Popov

Proceedings of the 2020 IEEE International Conference on Systems, Man, and Cybernetics, 2020

Deployment of Multi-agent Pathfinding on a Swarm of Physical Robots Centralized Control via Reflex-based Behavior.

[BibT_eX]

[DOI]

Ján Chudý

Nestor Popov

Proceedings of the International Conference on Robotics, 2020

Logic-Based Multi-agent Path Finding with Continuous Movements and the Sum of Costs Objective.

[BibT_eX]

[DOI]

Proceedings of the Artificial Intelligence - 18th Russian Conference, 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

Multi-agent Path Finding Modulo Theory with Continuous Movements and the Sum of Costs Objective.

[BibT_eX]

[DOI]

Proceedings of the KI 2020: Advances in Artificial Intelligence, 2020

Bounded Sub-optimal Multi-Robot Path Planning Using Satisfiability Modulo Theory (SMT) Approach.

[BibT_eX]

[DOI]

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

Bounded Suboptimal Token Swapping.

[BibT_eX]

[DOI]

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

At-Most-One Constraints in Efficient Representations of Mutex Networks.

[BibT_eX]

[DOI]

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

Continuous Multi-agent Path Finding via Satisfiability Modulo Theories (SMT).

[BibT_eX]

[DOI]

Proceedings of the Agents and Artificial Intelligence, 12th International Conference, 2020

On Satisfisfiability Modulo Theories in Continuous Multi-Agent Path Finding: Compilation-based and Search-based Approaches Compared.

[BibT_eX]

[DOI]

Proceedings of the 12th International Conference on Agents and Artificial Intelligence, 2020

2019

Multi-agent Path Finding with Continuous Time Viewed Through Satisfiability Modulo Theories (SMT).

[BibT_eX]

[DOI]

CoRR, 2019

Unifying Search-Based and Compilation-Based Approaches to Multi-Agent Path Finding through Satisfiability Modulo Theories.

[BibT_eX]

[DOI]

Proceedings of the Twelfth International Symposium on Combinatorial Search, 2019

Multi-Agent Path Finding with Continuous Time and Geometric Agents Viewed through Satisfiability Modulo Theories (SMT).

[BibT_eX]

[DOI]

Proceedings of the Twelfth International Symposium on Combinatorial Search, 2019

Lazy Compilation of Variants of Multi-robot Path Planning with Satisfiability Modulo Theory (SMT) Approach.

[BibT_eX]

[DOI]

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

On the Design of a Heuristic based on Artificial Neural Networks for the Near Optimal Solving of the (N2-1)-puzzle.

[BibT_eX]

[DOI]

Vojtech Cahlík

Proceedings of the 11th International Joint Conference on Computational Intelligence, 2019

Multi-agent Path Finding with Generalized Conflicts: An Experimental Study.

[BibT_eX]

[DOI]

Proceedings of the Agents and Artificial Intelligence - 11th International Conference, 2019

Conflict Handling Framework in Generalized Multi-agent Path finding: Advantages and Shortcomings of Satisfiability Modulo Approach.

[BibT_eX]

[DOI]

Proceedings of the 11th International Conference on Agents and Artificial Intelligence, 2019

Towards Smart Behavior of Agents in Evacuation Planning Based on Local Cooperative Path Finding.

[BibT_eX]

[DOI]

Róbert Selvek

Proceedings of the Knowledge Discovery, Knowledge Engineering and Knowledge Management, 2019

Engineering Smart Behavior in Evacuation Planning using Local Cooperative Path Finding Algorithms and Agent-based Simulations.

[BibT_eX]

[DOI]

Róbert Selvek

Proceedings of the 11th International Joint Conference on Knowledge Discovery, 2019

Multi-agent Path Finding with Capacity Constraints.

[BibT_eX]

[DOI]

T. K. Satish Kumar

Sven Koenig

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

On the Tour Towards DPLL(MAPF) and Beyond.

[BibT_eX]

[DOI]

Proceedings of the Discussion and Doctoral Consortium papers of AI*IA 2019, 2019

Multi-Agent Path Finding for Large Agents.

[BibT_eX]

[DOI]

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

2018

Solving Multi-agent Path Finding on Strongly Biconnected Digraphs.

[BibT_eX]

[DOI]

Adi Botea

Davide Bonusi

J. Artif. Intell. Res., 2018

A Summary of Adaptation of Techniques from Search-based Optimal Multi-Agent Path Finding Solvers to Compilation-based Approach.

[BibT_eX]

[DOI]

CoRR, 2018

Lazy Modeling of Variants of Token Swapping Problem and Multi-agent Path Finding through Combination of Satisfiability Modulo Theories and Conflict-based Search.

[BibT_eX]

[DOI]

CoRR, 2018

Sub-Optimal SAT-Based Approach to Multi-Agent Path-Finding Problem.

[BibT_eX]

[DOI]

Proceedings of the Eleventh International Symposium on Combinatorial Search, 2018

Solving Multi-Agent Path Finding on Strongly Biconnected Digraphs (Extended Abstract).

[BibT_eX]

[DOI]

Adi Botea

Davide Bonusi

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

Finding Optimal Solutions to Token Swapping by Conflict-Based Search and Reduction to SAT.

[BibT_eX]

[DOI]

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

Area Protection in Adversarial Path-finding Scenarios with Multiple Mobile Agents on Graphs - A Theoretical and Experimental Study of Strategies for Defense Coordination.

[BibT_eX]

[DOI]

Katsutoshi Hirayama

Proceedings of the 10th International Conference on Agents and Artificial Intelligence, 2018

Maintaining Ad-Hoc Communication Network in Area Protection Scenarios with Adversarial Agents.

[BibT_eX]

[DOI]

Diep Thi Ngoc Nguyen

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

2017

Area Protection in Adversarial Path-Finding Scenarios with Multiple Mobile Agents on Graphs: a theoretical and experimental study of target-allocation strategies for defense coordination.

[BibT_eX]

[DOI]

CoRR, 2017

Time-expanded graph-based propositional encodings for makespan-optimal solving of cooperative path finding problems.

[BibT_eX]

[DOI]

Ann. Math. Artif. Intell., 2017

The joint movement of pebbles in solving the ( N2 - 1 )-puzzle suboptimally and its applications in rule-based cooperative path-finding.

[BibT_eX]

[DOI]

Petr Michalík

Auton. Agents Multi Agent Syst., 2017

Modifying Optimal SAT-Based Approach to Multi-Agent Path-Finding Problem to Suboptimal Variants.

[BibT_eX]

[DOI]

Proceedings of the Tenth International Symposium on Combinatorial Search, 2017

Search-Based Optimal Solvers for the Multi-Agent Pathfinding Problem: Summary and Challenges.

[BibT_eX]

[DOI]

Proceedings of the Tenth International Symposium on Combinatorial Search, 2017

Modeling and Solving the Multi-agent Pathfinding Problem in Picat.

[BibT_eX]

[DOI]

Proceedings of the 29th IEEE International Conference on Tools with Artificial Intelligence, 2017

New Flow-based Heuristic for Search Algorithms Solving Multi-agent Path Finding.

[BibT_eX]

[DOI]

Jiri Svancara

Proceedings of the 9th International Conference on Agents and Artificial Intelligence, 2017

Variants of Independence Detection in SAT-Based Optimal Multi-agent Path Finding.

[BibT_eX]

[DOI]

Proceedings of the Agents and Artificial Intelligence - 9th International Conference, 2017

Integration of Independence Detection into SAT-based Optimal Multi-Agent Path Finding - A Novel SAT-based Optimal MAPF Solver.

[BibT_eX]

[DOI]

Proceedings of the 9th International Conference on Agents and Artificial Intelligence, 2017

Joint Movement of Pebbles in Solving the (N2-1)-Puzzle and its Applications in Cooperative Path-Finding: (JAAMAS).

[BibT_eX]

[DOI]

Petr Michalík

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

2016

Improvements in Sub-optimal Solving of the (N2-1)-Puzzle via Joint Relocation of Pebbles and its Applications to Rule-based Cooperative Path-Finding.

[BibT_eX]

[DOI]

Petr Michalík

CoRR, 2016

Makespan Optimal Solving of Cooperative Path-Finding via Reductions to Propositional Satisfiability.

[BibT_eX]

[DOI]

CoRR, 2016

An Empirical Comparison of the Hardness of Multi-Agent Path Finding under the Makespan and the Sum of Costs Objectives.

[BibT_eX]

[DOI]

Proceedings of the Ninth Annual Symposium on Combinatorial Search, 2016

Application of Longest Common Subsequence Algorithms to Meshing of Planar Domains with Quadrilaterals.

[BibT_eX]

[DOI]

Petra Surynková

Proceedings of the Mathematical Methods for Curves and Surfaces, 2016

Efficient SAT Approach to Multi-Agent Path Finding Under the Sum of Costs Objective.

[BibT_eX]

[DOI]

Proceedings of the ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands, 2016

Boolean Satisfiability Approach to Optimal Multi-agent Path Finding under the Sum of Costs Objective: (Extended Abstract).

[BibT_eX]

[DOI]

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

2015

On the Complexity of Optimal Parallel Cooperative Path-Finding.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2015

UniAGENT: Reduced Time-Expansion Graphs and Goal Decomposition in Sub-optimal Cooperative Path Finding.

[BibT_eX]

[DOI]

Proceedings of the Eighth Annual Symposium on Combinatorial Search, 2015

Reduced Time-Expansion Graphs and Goal Decomposition for Solving Cooperative Path Finding Sub-Optimally.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Multi-Agent Path Finding on Strongly Biconnected Digraphs.

[BibT_eX]

[DOI]

Adi Botea

Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014

Preprocessing in Propositional Satisfiability Using Bounded (2, k)-Consistency on Regions with a Locally Difficult Constraint Setup.

[BibT_eX]

[DOI]

Int. J. Artif. Intell. Tools, 2014

The Impact of a Bi-connected Graph Decomposition on Solving Cooperative Path-finding Problems.

[BibT_eX]

[DOI]

Petra Surynková

Milos Chromý

Fundam. Informaticae, 2014

Solving Abstract Cooperative Path-Finding in Densely Populated Environments.

[BibT_eX]

[DOI]

Comput. Intell., 2014

A Simple Approach to Solving Cooperative Path-Finding as Propositional Satisfiability Works Well.

[BibT_eX]

[DOI]

Proceedings of the PRICAI 2014: Trends in Artificial Intelligence, 2014

Simple Direct Propositional Encoding of Cooperative Path Finding Simplified Yet More.

[BibT_eX]

[DOI]

Proceedings of the Nature-Inspired Computation and Machine Learning, 2014

Compact Representations of Cooperative Path-Finding as SAT Based on Matchings in Bipartite Graphs.

[BibT_eX]

[DOI]

Proceedings of the 26th IEEE International Conference on Tools with Artificial Intelligence, 2014

Adversarial Cooperative Path-Finding: Complexity and Algorithms.

[BibT_eX]

[DOI]

Proceedings of the 26th IEEE International Conference on Tools with Artificial Intelligence, 2014

Theoretical Challenges in Knowledge Discovery in Big Data - A Logic Reasoning and a Graph Theoretical Point of View.

[BibT_eX]

[DOI]

Petra Surynková

Proceedings of the KEOD 2014, 2014

2013

Redundancy Elimination in Highly Parallel solutions of Motion Coordination Problems.

[BibT_eX]

[DOI]

Int. J. Artif. Intell. Tools, 2013

Optimal Cooperative Path-Finding with Generalized Goals in Difficult Cases.

[BibT_eX]

[DOI]

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

Mutex reasoning in cooperative path finding modeled as propositional satisfiability.

[BibT_eX]

[DOI]

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

A Survey of Collaborative Web Search - Through Collaboration among Search Engine Users to More Relevant Results.

[BibT_eX]

[DOI]

Proceedings of the KEOD 2013, 2013

Adversarial Cooperative Path-Finding: A First View.

[BibT_eX]

[DOI]

Proceedings of the Late-Breaking Developments in the Field of Artificial Intelligence, 2013

2012

A SAT-Based Approach to Cooperative Path-Finding Using All-Different Constraints.

[BibT_eX]

[DOI]

Proceedings of the Fifth Annual Symposium on Combinatorial Search, 2012

On Improving Plan Quality via Local Enhancements.

[BibT_eX]

[DOI]

Tomás Balyo

Proceedings of the Fifth Annual Symposium on Combinatorial Search, 2012

Towards Optimal Cooperative Path Planning in Hard Setups through Satisfiability Solving.

[BibT_eX]

[DOI]

Proceedings of the PRICAI 2012: Trends in Artificial Intelligence, 2012

On Propositional Encodings of Cooperative Path-Finding.

[BibT_eX]

[DOI]

Proceedings of the IEEE 24th International Conference on Tools with Artificial Intelligence, 2012

Shortening Plans by Local Re-planning.

[BibT_eX]

[DOI]

Tomás Balyo

Proceedings of the IEEE 24th International Conference on Tools with Artificial Intelligence, 2012

Relocation tasks and a hierarchical subclass.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Machine Learning and Cybernetics, 2012

Application of propositional satisfiability to special cases of cooperative path-planning.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Machine Learning and Cybernetics, 2012

An Alternative Eager Encoding of the All-Different Constraint over Bit-Vectors.

[BibT_eX]

[DOI]

Proceedings of the ECAI 2012, 2012

2011

Automated Classification of Bitmap Images using Decision Trees.

[BibT_eX]

[DOI]

Ivana Luksová

Polibits, 2011

Exploiting Global Properties in Path-Consistency Applied on SAT.

[BibT_eX]

[DOI]

Proceedings of the Eleventh Scandinavian Conference on Artificial Intelligence, 2011

2010

Discovering implied constraints in precedence graphs with alternatives.

[BibT_eX]

[DOI]

Ondrej Cepek

Ann. Oper. Res., 2010

An Optimization Variant of Multi-Robot Path Planning Is Intractable.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010

2009

An Application of Pebble Motion on Graphs to Abstract Multi-robot Path Planning.

[BibT_eX]

[DOI]

Proceedings of the ICTAI 2009, 2009

A novel approach to path planning for multiple robots in bi-connected graphs.

[BibT_eX]

[DOI]

Proceedings of the 2009 IEEE International Conference on Robotics and Automation, 2009

Towards Shorter Solutions for Problems of Path Planning for Multiple Robots in Theta-like Environments.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Second International Florida Artificial Intelligence Research Society Conference, 2009

2008

Domain-Dependent View of Multiple Robots Path Planning.

[BibT_eX]

[DOI]

Proceedings of the STAIRS 2008, 2008

Tractable Class of a Problem of Goal Satisfaction in Mutual Exclusion Network.

[BibT_eX]

[DOI]

Proceedings of the Twenty-First International Florida Artificial Intelligence Research Society Conference, 2008

2007

Encoding of Planning Problems and Their Optimizations in Linear Logic.

[BibT_eX]

[DOI]

Lukás Chrpa

Jirí Vyskocil

Proceedings of the Applications of Declarative Programming and Knowledge Management, 2007

Solving Difficult SAT Instances Using Greedy Clique Decomposition.

[BibT_eX]

[DOI]

Proceedings of the Abstraction, 2007

Solving Difficult Problems by Viewing them as Structured Dense Graphs.

[BibT_eX]

Lukás Chrpa

Jirí Vyskocil

Proceedings of the 3rd Indian International Conference on Artificial Intelligence, 2007

Maintaining Arc-Consistency over Mutex Relations in Planning Graphs during Search.

[BibT_eX]

[DOI]

Proceedings of the Twentieth International Florida Artificial Intelligence Research Society Conference, 2007

A Global Filtration for Satisfying Goals in Mutual Exclusion Networks.

[BibT_eX]

[DOI]

Proceedings of the Recent Advances in Constraints, 2007

Modelling Alternatives in Temporal Networks.

[BibT_eX]

[DOI]

Ondrej Cepek

Proceedings of the 2007 IEEE Symposium on Computational Intelligence in Scheduling, 2007

2005

An Improved Algorithm for Maintaining Arc Consistency in Dynamic Constraint Satisfaction Problems.

[BibT_eX]

[DOI]

Proceedings of the Eighteenth International Florida Artificial Intelligence Research Society Conference, 2005

Encoding HTN Planning as a Dynamic CSP.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2005

2004

A New Algorithm for Maintaining Arc Consistency After Constraint Retraction.

[BibT_eX]

[DOI]