Using constraint programming in anytime path planner
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61389005%3A_____%2F11%3A00368662" target="_blank" >RIV/61389005:_____/11:00368662 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Using constraint programming in anytime path planner
Original language description
Path planning in one of the critical tasks for autonomous robots. We will study the problem of finding the shortest path for a robot collecting waste spread over the area such that thet robot has a limited capacity and hence during the route it must periodically visit depost/collectors to empty the collected waste.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
BG - Nuclear, atomic and molecular physics, accelerators
OECD FORD branch
—
Result continuities
Project
—
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2011
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
Sborník workshopu doktorandů FJFI oboru Matematické inženýrství
ISBN
978-80-01-04907-5
ISSN
—
e-ISSN
—
Number of pages
10
Pages from-to
285-294
Publisher name
ČVUT
Place of publication
Praha
Event location
Praha
Event date
Nov 11, 2011
Type of event by nationality
CST - Celostátní akce
UT code for WoS article
—