By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Pavel Surynek ; Charles University in Prague, Malostranske mimesti 25, 118 00 Praha 1, Czech Republic

A problem of cooperative path-planning is addressed from the perspective of propositional satisfiability in this paper. Two new encodings of the problem as SAT are proposed and evaluated. Together with the existent solution optimization method which locally improves a sub-optimal solution of the problem through SAT solving, one of the new encodings constitute a state-of-the-art method for cooperative path-planning in highly occupied environments.

Published in:

2012 International Conference on Machine Learning and Cybernetics  (Volume:2 )

Date of Conference:

15-17 July 2012