Application of Propositional Satistiability to Special Cases of Cooperative Path-Planning
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F12%3A10126383" target="_blank" >RIV/00216208:11320/12:10126383 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Application of Propositional Satistiability to Special Cases of Cooperative Path-Planning
Original language description
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 evalu-ated.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
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ů
Data specific for result type
Article name in the collection
Proceedings of the International Conference on Machine Learning and Cybernetics
ISBN
978-1-4673-1486-2
ISSN
—
e-ISSN
—
Number of pages
6
Pages from-to
507-512
Publisher name
IEEE Association
Place of publication
Xian
Event location
Xian, China
Event date
Jul 15, 2012
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—