.png){kind=icon}
Return
Capturing a convex object with three discs
.png){kind=icon}
PRE
AI
DOI：10.1109/TRO.2007.909814.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper addresses the problem of capturing an arbitrary convex object P in the plane with three congruent disc-shaped robots. Given two stationary robots in contact with P, we characterize the set of positions of a third robot, the so-called capture region, that prevent P from escaping to infinity via continuous rigid motion. We show that the computation of the capture region reduces to a visibility problem. We present two algorithms for solving this problem, and for computing the capture region when P is a polygon and the robots are points (zero-radius discs). The first algorithm is exact and has polynomial time complexity. The second one uses simple hidden surface removal techniques from computer graphics to output an arbitrarily accurate approximation of the capture region; it has been implemented, and examples are presented.
Keywords:
caging
capture region
capturing
motion-planning
multiple manipulators
robots
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
10.5
Papers:
3.3K
Citations:
2.8W
Organization
Cited Papers
ShareSave
Mechanisms of Resistance to Epidermal Growth Factor Receptor (EGFR) in Non‐Small Cell Lung Cancer.png)
Lung Cancer
Lung CancerIF0
PREAI
ShareSaveShareSaveShareSaveShareSave
View more