mlsanityData to 14 Oct 2026

Answer Set Planning: A Survey

arXiv 2202.05793 ↗First posted 11 Feb 2022cs.AIcited by 12

Not on the map. Why?

Abstract (arXiv)

Answer Set Planning refers to the use of Answer Set Programming (ASP) to compute plans, i.e., solutions to planning problems, that transform a given state of the world to another state. The development of efficient and scalable answer set solvers has provided a significant boost to the development of ASP-based planning systems. This paper surveys the progress made during the last two and a half decades in the area of answer set planning, from its foundations to its use in challenging planning domains. The survey explores the advantages and disadvantages of answer set planning. It also discusses typical applications of answer set planning and presents a set of challenges for future research.

Key facts. Cited by 12 papers in the map (data through 14 Oct 2026). Builds on 30 of its 276 references that are in the map. First posted on arXiv 11 Feb 2022.

Builds on

30 of 276 references.

References · 30

  1. 2013The Complexity of Decentralized Control of Markov Decision Processescited by 231
  2. 2019Multi-Agent Pathfinding: Definitions, Variants, and Benchmarkscited by 199
  3. 2017Multi-shot ASP solving with clingocited by 115
  4. 2019ASP-Core-2 Input Language Formatcited by 77
  5. 2018Task Planning in Robotics: an Empirical Comparison of PDDL-based and ASP-based Systemscited by 40
  6. 2016Optimal Target Assignment and Path Finding for Teams of Agentscited by 25
  7. 2016Multi-Agent Path Finding with Delay Probabilitiescited by 18
  8. 2014MAPP: a Scalable Multi-Agent Path Planning Algorithm with Tractability and Completeness Guaranteescited by 15
  9. 2017Clingcon: The Next Generationcited by 15
  10. 2014Topological Value Iteration Algorithmscited by 13
  11. 2015Optimal Multi-Robot Path Planning on Graphs: Complete Algorithms and Effective Heuristicscited by 12
  12. 2018Experimenting with robotic intra-logistics domainscited by 12
18 more
  1. 2014Compiling Uncertainty Away in Conformant Planning Problems with Bounded Widthcited by 11
  2. 2018A General Multi-agent Epistemic Planner Based on Higher-order Belief Changecited by 10
  3. 2017Cooperative Epistemic Multi-Agent Planning for Implicit Coordinationcited by 8
  4. 2021Planning with Incomplete Information in Quantified Answer Set Programmingcited by 8
  5. 2018Routing Driverless Transport Vehicles in Car Assembly with Answer Set Programmingcited by 7
  6. 2018Multi-Agent Path Finding with Deadlinescited by 7
  7. 2018plasp 3: Towards Effective ASP Planningcited by 6
  8. 2017Hybrid Conditional Planning using Answer Set Programmingcited by 4
  9. 2020Modelling Multi-Agent Epistemic Planning in ASPcited by 4
  10. 2014Lazy Model Expansion: Interleaving Grounding with Searchcited by 3
  11. 2019Multi-Agent Pathfinding with Continuous Timecited by 3
  12. 2020Human Robot Collaborative Assembly Planning: An Answer Set Programming Approachcited by 3
  13. 2015An approach to multi-agent planning with incomplete informationcited by 2
  14. 2019Degrees of Laziness in Grounding: Effects of Lazy-Grounding Strategies on ASP Solvingcited by 2
  15. 2013Supply Restoration in Power Distribution Systems - A Case Study in Integrating Model-Based Diagnosis and Repair Planningcited by 1
  16. 2017Solving Distributed Constraint Optimization Problems Using Logic Programmingcited by 1
  17. 2019Elaboration Tolerant Representation of Markov Decision Process via Decision-Theoretic Extension of Probabilistic Action Language pBC+cited by 1
  18. 2019A Correctness Result for Synthesizing Plans With Loops in Stochastic Domainscited by 1

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2023: 3; 2024: 3; 2025: 3; 2026: 3.

12 papers.