Efficiently solving general rearrangement tasks: A fast extension primitive for an incremental sampling-based planner

Athanasios Krontiris, Kostas E. Bekris. Efficiently solving general rearrangement tasks: A fast extension primitive for an incremental sampling-based planner. In Danica Kragic, Antonio Bicchi, Alessandro De Luca 0001, editors, 2016 IEEE International Conference on Robotics and Automation, ICRA 2016, Stockholm, Sweden, May 16-21, 2016. pages 3924-3931, IEEE, 2016. [doi]

Authors

Athanasios Krontiris

This author has not been identified. Look up 'Athanasios Krontiris' in Google

Kostas E. Bekris

This author has not been identified. Look up 'Kostas E. Bekris' in Google