Practical resolution methods for MDPs in robotics exemplified with disassembly planning
Cita com:
hdl:2117/178895
Tipus de documentArticle
Data publicació2019-07-01
EditorInstitute of Electrical and Electronics Engineers (IEEE)
Condicions d'accésAccés obert
Llevat que s'hi indiqui el contrari, els
continguts d'aquesta obra estan subjectes a la llicència de Creative Commons
:
Reconeixement-NoComercial-SenseObraDerivada 3.0 Espanya
Abstract
In this paper we focus on finding practical resolution methods for Markov Decision Processes (MDPs) in robotics. Some of the main difficulties of applying MDPs to real-world robotics problems are: (1) having to deal with huge state spaces; and (2) designing a method that is robust enough to dead ends. These complications restrict or make more difficult the application of methods such as Value Iteration, Policy Iteration or Labeled Real Time Dynamic Programming (LRTDP). We see in determinization and heuristic search a way to successfully work around these problems. In addition, we believe that many practical use cases offer the opportunity to identify hierarchies of subtasks and solve smaller, simplified problems. We propose a decision-making unit that operates in a probabilistic planning setting through Stochastic Shortest Path Problems (SSPPs), which generalize the most common types of MDPs. Our decision-making unit combines: (1) automatic hierarchical organization of subtasks; and (2) on-line resolution via determinization. We argue that several applications of planning benefit from these two strategies. We exemplify our approach with a robotized disassembly application. The disassembly problem is modeled in Probabilistic Planning Definition Language (PPDDL), and serves to define our experiments. Our results show many advantages of our method over LRTDP, like a better capability to handle problems with large state spaces and state definitions that change when new fluents are discovered.
Descripció
© 2019 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
CitacióSuarez, A.; Torras, C.; Alenyà, G. Practical resolution methods for MDPs in robotics exemplified with disassembly planning. "IEEE robotics and automation letters", 1 Juliol 2019, vol. 4, núm. 3, p. 2282-2288.
ISSN2377-3766
Versió de l'editorhttps://ieeexplore.ieee.org/document/8653968/
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
2167-Practical- ... h-Disassembly-Planning.pdf | 891,4Kb | Visualitza/Obre |