Efficient Path Planning In Manipulation Planning Problems by Actively Reusing Validation Effort
Valentin N. Hartmann, Joaquim Ortiz-Haro, Marc Toussaint
Machine Learning & Robotics Lab, University of Stuttgart, Germany
Learning and Intelligent Systems Group, TU Berlin, Germany
Brief: We introduce a decomposed collision checking procedure that enables reuse of collision checking results even if the environment changes. Collision checking is split in multiple parts, and the search in path planning is ordered by expected validation effort.
Abstract:
Paper
Latest version: arXiv
Bibtex
1
2
3
4
5
6
7
8
9
@inproceedings{23-hartmann-IROS,
title = {Efficient Path Planning In Manipulation Planning Problems by
Actively Reusing Validation Effort},
author = {Hartmann, Valentin N. and Ortiz-Haro, Joaquim and
Toussaint, Marc},
year = {2023},
booktitle = {"Proc{.} of the IEE/RSJ Int{.} Conf{.} on Intelligent Robots and Systems (IROS)"},
url = {https://arxiv.org/abs/2303.00637},
}
Funding
The research has been supported by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) under Germany’s Excellence Strategy – EXC 2120/1 – 390831618 “IntCDC” and by the German-Israeli Foundation for Scientific Research (GIF) grant I-1491-407.6/2019.