MANIPULATION
A 1200×1200 8-Edges/Vertex FPGA-Based Motion-Planning Accelerator for Dual-Arm-Robot Manipulation Systems
Atsutake Kosuge, T. Oshima
- Year
- 2020
- Citations
- 10
Abstract
An SoC-FPGA-based motion-planning accelerator operating on a graph with >10M edges is presented for the first time for dual-am-robot manipulation systems. The proposed modified A∗ algorithm with minimized memory access time, is further accelerated by extensive parallel computation and dynamic reconfigurations. The proposed accelerator has been verified by measurement result showing overall motion-planning time of 0.5 seconds, which is only 1/100 of the one by conventional algorithm on embedded CPU, while preserving accuracy.
Keywords
Field-programmable gate arrayComputer scienceComputationVertex (graph theory)Dual (grammatical number)RobotMotion planningGraphComputer hardwareArtificial intelligence
Related papers
OTHER
📊 26,957 cites
Statistical Learning Theory
Yuhai Wu, Vladimir Vapnik
1999
PERCEPTION
📊 22,245 cites
Artificial intelligence: a modern approach
1995
OTHER
📊 18,993 cites
Applied Nonlinear Control
Jean-Jacques Slotine, Weiping Li
1991
SWARM
📊 14,853 cites
A new optimizer using particle swarm theory
R.C. Eberhart, James Kennedy
2002