References

  1. Aysu Bogatarkan & Esra Erdem (2020): Explanation Generation for Multi-Modal Multi-Agent Path Finding with Optimal Resource Utilization using Answer Set Programming. Theory Pract. Log. Program. 20(6), pp. 974–989, doi:10.1017/S1471068420000320. Available at https://arxiv.org/abs/2008.03573.
  2. Aysu Bogatarkan, Esra Erdem, Alexander Kleiner & Volkan Patoglu (2020): Multi-modal Multi-agent Path Finding with Optimal Resource Utilization. In: Proceedings of 5th International Conference on the Industry 4.0 Model for Advanced Manufacturing, pp. 313–324, doi:10.1007/978-3-030-46212-3_24.
  3. Aysu Bogatarkan, Volkan Patoglu & Esra Erdem (2019): A Declarative Method for Dynamic Multi-Agent Path Finding. In: Proceedings of the 5th Global Conference on Artificial Intelligence, pp. 54–67, doi:10.29007/cnzw.
  4. Gerhard Brewka, Thomas Eiter & Miroslaw Truszczynski (2011): Answer set programming at a glance. ACM Commununications 54(12), pp. 92–103, doi:10.1145/2043174.2043195.
  5. Gerhard Brewka, Thomas Eiter & Miroslaw Truszczynski (2016): Answer Set Programming: An Introduction to the Special Issue. AI Magazine 37(3), pp. 5–6, doi:10.1609/aimag.v37i3.2669.
  6. Edsger W. Dijkstra (1959): A Note on Two Problems in Connexion with Graphs. Numer. Math. 1(1), pp. 269–271, doi:10.1007/BF01386390.
  7. Kurt M. Dresner & Peter Stone (2008): A Multiagent Approach to Autonomous Intersection Management. J. Artif. Intell. Res. (JAIR) 31, pp. 591–695, doi:10.1613/jair.2502.
  8. Martin Gebser, Benjamin Kaufmann, Roland Kaminski, Max Ostrowski, Torsten Schaub & Marius Schneider (2011): Potassco: The Potsdam Answer Set Solving Collection. AI Commun. 24(2), pp. 107124, doi:10.5555/1971622.1971623.
  9. Michael Gelfond & Vladimir Lifschitz (1988): The stable model semantics for logic programming. In: Proceedings of International Logic Programming Conference and Symposium, pp. 1070–1080.
  10. Michael Gelfond & Vladimir Lifschitz (1991): Classical negation in logic programs and disjunctive databases. New Generation Computing 9, pp. 365–385, doi:10.1007/BF03037169.
  11. Jae-Yeong Lee & Wonpil Yu (2009): A coarse-to-fine approach for fast path finding for mobile robots. In: Proc. of IROS, pp. 5414–5419, doi:10.1109/IROS.2009.5354686.
  12. Vladimir Lifschitz (2002): Answer set programming and plan generation. Artificial Intelligence 138, pp. 39–54, doi:10.1016/S0004-3702(02)00186-8.
  13. Victor Marek & Mirosław Truszczyński (1999): Stable models and an alternative logic programming paradigm. In: The Logic Programming Paradigm: a 25-Year Perspective. Springer Verlag, pp. 375–398, doi:10.1007/978-3-642-60085-2_17.
  14. John McCarthy (1998): Elaboration Tolerance. In: Proc. of CommonSense.
  15. Robert Morris, Corina S. Pasareanu, Kasper Søe Luckow, Waqar Malik, Hang Ma, T. K. Satish Kumar & Sven Koenig (2016): Planning, Scheduling and Monitoring for Airport Surface Operations. In: Planning for Hybrid Systems, Papers from AAAI Workshop..
  16. Ilkka Niemelä (1999): Logic programs with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Artificial Intelligence 25, pp. 241–273, doi:10.1023/A:1018930122475.
  17. Daniel Ratner & Manfred K. Warmuth (1986): Finding a Shortest Solution for the N N Extension of the 15-PUZZLE Is Intractable. In: Proc. of AAAI, pp. 168–172.
  18. Emre Hilmi Songur, Aysu Bogatarkan, Farukhzhon Barotov, Batuhan Yildirim, Gokay Coruhlu, Esra Erdem & Volkan Patoglu (2019): Cok-etmenli yorunge bulma probleminin lego robotlarinda uygulanmasi: bir egitsel robotik calismasi. In: 5. Türkiye Robotbilim Konferans\IeCı (TORK 2019). Ozyegin Universitesi Yayinlari, pp. 172–177. Available at https://tork2019.ozyegin.edu.tr/sites/default/files/tork2019_r1.pdf.
  19. Trevor Scott Standley & Richard E. Korf (2011): Complete Algorithms for Cooperative Pathfinding Problems. In: Proc. of IJCAI, pp. 668–673, doi:10.5591/978-1-57735-516-8/IJCAI11-118.
  20. Peter R. Wurman, Raffaello D'Andrea & Mick Mountz (2008): Coordinating Hundreds of Cooperative, Autonomous Vehicles in Warehouses. AI Magazine 29(1), pp. 9–20, doi:10.1609/aimag.v29i1.2082.

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org