Home /Research /Dadu-P
OTHER

Dadu-P

Shiqi Lian, Yinhe Han, Ying Wang, Hang Xiao

Year
2018
Citations
24

Abstract

As a critical operation in robotics, motion planning consumes lots of time and energy, especially in a dynamic environment. Through approaches based on general-purpose processors, it is hard to get a valid planning in real time. We present an accelerator to speed up collision detection, which costs over 90% of the computation time in motion planning. Via the octree-based roadmap representation, the accelerator can be reconfigured online and support large roadmaps. We in addition propose an effective algorithm to update the roadmap in a dynamic environment, together with a batched incremental processing approach to reduce the complexity of collision detection. Experimental results show that our accelerator achieves 26.5X speedup than an existing CPU-based approach. With the incremental approach, the performance further improves by 10X while the solution quality is degraded by 10% only.

Keywords

SpeedupComputer scienceComputationOctreeRepresentation (politics)Motion planningRoboticsReal-time computingArtificial intelligenceRobot

Related papers

Browse all OTHER papers