Towards Routing in Robotics: 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%2F68407700%3A21340%2F11%3A00192632" target="_blank" >RIV/68407700:21340/11:00192632 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Towards Routing in Robotics: Using Constraint Programming in Anytime Path Planner
Original language description
Path planning is 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 the robot has a limited capacity and hence during the route it must periodically visit depots/collectors to empty the collected waste. This is a variant of often overlooked vehicle routing problem with satellite facilities. We present the approach based on Constraint Programming techniques driven by the concept of finite state automaton. The experimental comparison and enhancements of models are discussed.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
—
Continuities
S - Specificky vyzkum na vysokych skolach
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
Doktorandské dny 2011
ISBN
978-80-01-04907-5
ISSN
—
e-ISSN
—
Number of pages
9
Pages from-to
295-303
Publisher name
Česká technika - nakladatelství Č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
—