Time-expanded graph-based propositional encodings for makespan-optimal solving of cooperative path finding problems-Reference-Cited by-同舟云学术

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

Published:2017-08-02 Issue:3-4 Volume:81 Page:329-375
ISSN:1012-2443
Container-title:Annals of Mathematics and Artificial Intelligence
language:en
Short-container-title:Ann Math Artif Intell

Author:

Surynek Pavel

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Artificial Intelligence

Link

http://link.springer.com/article/10.1007/s10472-017-9560-z/fulltext.html

Reference71 articles.

1. Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network flows: theory, algorithms, and applications. Prentice Hall (1993)

2. Audemard, G., Simon, L.: The Glucose SAT Solver. http://labri.fr/perso/lsimon/glucose/ . [accessed in September 2014] (2013)

3. Audemard, G., Simon, L.: Predicting Learnt Clauses Quality in Modern SAT Solvers. In: Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI 2009), pp. 399–404 (2009)

4. Bailleux, O., Boufkhad, Y.: Efficient CNF encoding of Boolean cardinality constraints. In: Principles and Practice of Constraint Programming, 9th International Conference (CP 2003), pp. 108–122, LNCS 2833, Springer (2003)

5. Balint, A., Belov, A., Heule, M., Järvisalo, M.: SAT 2013 competition. http://www.satcompetition.org/ . [accessed in April 2015] (2013)

Cited by 16 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Non-Refined Abstractions in Counterexample Guided Abstraction Refinement for Multi-Agent Path Finding;2023 IEEE 35th International Conference on Tools with Artificial Intelligence (ICTAI);2023-11-06

2. Counterexample Guided Abstraction Refinement with Non-Refined Abstractions for Multi-Goal Multi-Robot Path Planning;2023 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS);2023-10-01

3. Multi-agent path finding with mutex propagation;Artificial Intelligence;2022-10

4. Multi-agent pathfinding with continuous time;Artificial Intelligence;2022-04

5. Multi-agent Path Finding and Acting with Small Reflex-Based Mobile Robots;Communications in Computer and Information Science;2022