Proceedings 1992 IEEE International Conference on Robotics and Automation
DOI: 10.1109/robot.1992.220067
|View full text |Cite
|
Sign up to set email alerts
|

A new algorithm for robot curve-following amidst unknown obstacles, and a generalization of maze-searching

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
4
0

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 15 publications
(4 citation statements)
references
References 4 publications
0
4
0
Order By: Relevance
“…Traditional obstacle avoidance techniques can be adapted to control the way how drones can prevent exposure to such intangible areas. We adapt strategies from the field of robotics [5], e.g., potentialfunction-based control [6], [7], curve following [8] strategies and bug algorithms [9]. There are also studies (some of which are very recent) on various collision and obstacle avoidance approaches for drones [10]- [13].…”
Section: Related Workmentioning
confidence: 99%
“…Traditional obstacle avoidance techniques can be adapted to control the way how drones can prevent exposure to such intangible areas. We adapt strategies from the field of robotics [5], e.g., potentialfunction-based control [6], [7], curve following [8] strategies and bug algorithms [9]. There are also studies (some of which are very recent) on various collision and obstacle avoidance approaches for drones [10]- [13].…”
Section: Related Workmentioning
confidence: 99%
“…(3) Reverse condition: A robot may change its following direction if it returned a visited position (identified a loop) [3; 5; 9]. (4) Topologic condition: This is designed under the Jordan's curve theorem by using the segment q and its intersecting obstacles [7]. (5) Geometric condition: This is designed by obstacle geometry such as a variation of tangential vectors [8; 9; 10].…”
Section: Introductionmentioning
confidence: 99%
“…These algorithms are categorized into the Metric algorithm. As contrasted with this, the algorithm gurvI is designed by the conditions (2) and (4) [7], and therefore it is called the Topologic algorithm. The algorithms Topology I and II have the conditions (3) and (5) [9], and the algorithm Robust includes the conditions (2) and (5) [8].…”
Section: Introductionmentioning
confidence: 99%
“…Because the environment of the construction site is unstructured and changing, it is reasonable to apply the path planning algorithm in an unknown environment to the construction site. The path planning algorithm in an unknown environment includes Bugl [7], Bug2 [7], VisBug [8], Curvl [12], Azimuth [9], Tangent [5,6], and DistBug [2].…”
Section: Introductionmentioning
confidence: 99%