Author of the publication

Reduction-based Solving of Multi-agent Pathfinding on Large Maps Using Graph Pruning.

, , , , and . AAMAS, page 624-632. International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS), (2022)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

No One SATPlan Encoding To Rule Them All., and . SOCS, page 146-150. AAAI Press, (2015)Yet more planning efficiency: Finite-domain state-variable reformulation., , and . J. Exp. Theor. Artif. Intell., 27 (5): 543-576 (2015)Planning and Reactive Agents in Dynamic Game Environments - An Experimental Study., , , and . ICAART (1), page 234-240. SciTePress, (2013)Visopt ShopFloor: Going Beyond Traditional Scheduling.. International Workshop on Constraint Solving and Constraint Logic Programming, volume 2627 of Lecture Notes in Computer Science, page 185-199. Springer, (2002)The Third Competition on Knowledge Engineering for Planning and Scheduling., , and . AI Magazine, 31 (1): 95-98 (2010)Constraint Programming: In Pursuit of the Holy Grail. Proceedings of Week of Doctoral Students (WDS99), page 555-564. (1999)Tutorial: constraint-based scheduling.. CISched, IEEE, (2009)Using Constraint Logic Programming to Schedule Solar Array Operations on the International Space Station., and . PADL, volume 9585 of Lecture Notes in Computer Science, page 3-12. Springer, (2016)Rina Dechter , Constraint Processing, Morgan Kaufmann Publisher (2003) ISBN 1-55860-890-7, Francesca Rossi, Peter van Beek and Toby Walsh, Editors, Handbook of Constraint Programming, Elsevier (2006) ISBN 978-0-444-52726-4.. Comput. Sci. Rev., 2 (2): 123-130 (2008)Introduction: Special issue on constraint satisfaction techniques for planning and scheduling problems., , and . Eng. Appl. Artif. Intell., 21 (5): 679-682 (2008)