Layered task planning for mobile manipulators
| dc.contributor.author | Djezairi, Salim | |
| dc.contributor.author | Boushaki Zamoum, Razika | |
| dc.contributor.author | Akli, Isma | |
| dc.contributor.author | Bouzouia, Brahim | |
| dc.date.accessioned | 2022-09-14T13:06:13Z | |
| dc.date.available | 2022-09-14T13:06:13Z | |
| dc.date.issued | 2019 | |
| dc.description.abstract | Task planning for mobile manipulators is a challenging problem in robotics. Mobile ma- nipulators can perform a wide range of tasks in complex environments. They must process the symbolic knowledge in order to find a sequence of actions that achieves the specified goals. This paper proposes a hybrid approach named Planning with Shortcuts. It uses a data structure called Layered Task Graph (LTG) which groups primitive actions, robot skills and task patterns in a strictly hierarchical manner. It then uses the LTG to create shortcuts in the state space in order to accelerate the search. A task planner is called to find a set of actions that achieves the goal task. The result of the search is a sequence of high level actions and primitive actions. The high level actions are then decomposed using the task decomposition approach. | en_US |
| dc.identifier.other | https://doi.org/10.1016/j.compeleceng.2019.106464 | |
| dc.identifier.uri | https://dspace.univ-boumerdes.dz/handle/123456789/9994 | |
| dc.language.iso | en | en_US |
| dc.publisher | Elsevier | en_US |
| dc.relation.ispartofseries | Computers and Electrical Engineering/ Vol. 79(2019); | |
| dc.subject | Task planning | en_US |
| dc.subject | Mobile manipulator | en_US |
| dc.subject | Layered task graph | en_US |
| dc.subject | Planning with shortcuts | en_US |
| dc.subject | BFS | en_US |
| dc.title | Layered task planning for mobile manipulators | en_US |
| dc.type | Article | en_US |
