Paper Info
Title
Soft subdivision motion planning for complex planar robots
Abstract
The design and implementation of theoretically-sound robot motion planning algorithms is challenging. Within the framework of resolution-exact algorithms, it is possible to exploit soft predicates for collision detection. The design of soft predicates is a balancing act between their implementability and their accuracy/effectivity.
Year
DOI
Venue
2018
10.1016/j.comgeo.2020.101683
Computational Geometry
Keywords
Field
DocType
Computational geometry,Algorithmic motion planning,Resolution-exact algorithms,Soft predicates,Planar robots with complex geometry
Motion planning,Discrete mathematics,Polygon,Collision detection,Computer science,Computational geometry,Exploit,Theoretical computer science,Subdivision,Complex geometry,Robot
Conference
Volume
ISSN
Citations 
92
0925-7721
0
PageRank 
References 
Authors
0.34
0
3
Name
Order
Citations
PageRank
Bo Zhou15811.39
Yi-jen Chiang250338.21
Chee-Keng Yap31996395.32