Near Optimal Cooperative Path Planning in Hard Setups through Satisfiability Solving
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F12%3A10126380" target="_blank" >RIV/00216208:11320/12:10126380 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Near Optimal Cooperative Path Planning in Hard Setups through Satisfiability Solving
Original language description
A new approach to cooperative path-planning is presented. The makespan of a solution to a path-planning instance is op-timized by a SAT solver.
Czech name
—
Czech description
—
Classification
Type
O - Miscellaneous
CEP classification
JD - Use of computers, robotics and its application
OECD FORD branch
—
Result continuities
Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2012
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů