{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T09:53:38Z","timestamp":1777715618095,"version":"3.51.4"},"reference-count":20,"publisher":"SAGE Publications","issue":"9","license":[{"start":{"date-parts":[[1998,9,1]],"date-time":"1998-09-01T00:00:00Z","timestamp":904608000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The International Journal of Robotics Research"],"published-print":{"date-parts":[[1998,9]]},"abstract":"<jats:p>The Bug family algorithms navigate a 2-DOF mobile robot in a completely unknown environment using sensors. TangentBug is a new algorithm in this family, specifically designed for using a range sensor. TangentBug uses the range data to compute a locally short est path, based on a novel structure termed the local tangent graph (LTG). The robot uses the LTG for choosing the locally optimal di rection while moving toward the target, and for making local short- cuts and testing a leaving condition while moving along an obstacle boundary. The transition between these two modes of motion is governed by a globally convergent criterion, which is based on the distance of the robot from the target. We analyze the properties of TangentBug, and present simulation results that show that Tangent Bug consistently performs better than the classical Bug algorithms. The simulation results also show that TangentBug produces paths that in simple environments approach the globally optimal path, as the sensor's maximal detection-range increases. The algorithm can be readily implemented on a mobile robot, and we discuss one such implementation.<\/jats:p>","DOI":"10.1177\/027836499801700903","type":"journal-article","created":{"date-parts":[[2007,3,11]],"date-time":"2007-03-11T03:05:13Z","timestamp":1173582313000},"page":"934-953","source":"Crossref","is-referenced-by-count":153,"title":["TangentBug: A Range-Sensor-Based Navigation Algorithm"],"prefix":"10.1177","volume":"17","author":[{"given":"Ishay","family":"Kamon","sequence":"first","affiliation":[{"name":"Department of Computer Science"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elon","family":"Rimon","sequence":"additional","affiliation":[{"name":"Department of Mechanical Engineering Technion Haifa 32000, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ehud","family":"Rivlin","sequence":"additional","affiliation":[{"name":"Department of Computer Science"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[1998,9,1]]},"reference":[{"key":"atypb1","doi-asserted-by":"crossref","unstructured":"Arkin, R.C. 1987 (Raleigh, NC). Motor schema based navigation for a mobile robot: An approach for programming by behavior. Proc. Int. Conf. Robotics and Automat Los Alamitos, CA : IEEE, pp. 264-271.","DOI":"10.1109\/ROBOT.1987.1088037"},{"key":"atypb2","doi-asserted-by":"publisher","DOI":"10.1016\/0921-8890(94)90027-2"},{"key":"atypb3","doi-asserted-by":"crossref","unstructured":"Borenstein, J., and Koren, Y. 1990 (Cincinnati, OH). Real-time obstacle avoidance for fast mobile robots in cluttered environments. Proc. Int. Conf. Robot. and Automat Los Alamitos, CA: IEEE, pp. 572-577.","DOI":"10.1109\/ROBOT.1990.126042"},{"key":"atypb4","doi-asserted-by":"crossref","unstructured":"Choset, H., and Burdick, J.W. 1995 (Nagoya, Japan). Sensor-based planning, part II: Incremental construction of the generalized Voronoi graph. Proc. Int. Conf. Robot. and Automat Washington, DC: IEEE, pp. 1643-1649.","DOI":"10.1109\/ROBOT.1995.525510"},{"key":"atypb5","doi-asserted-by":"publisher","DOI":"10.1016\/0165-1684(93)90034-8"},{"key":"atypb6","doi-asserted-by":"publisher","DOI":"10.1109\/70.210800"},{"key":"atypb7","unstructured":"Goodridge, S.G., and Luo, R.C. 1994 (San Diego, CA). Fuzzy behavior fusion for reactive control of an autonomous mobile robot: Marge. Proc. Int. Conf. Robot. and Automat Los Alamitos, CA: IEEE, pp. 1622-1627."},{"key":"atypb8","volume-title":"A new range-sensor based globally convergent navigation algorithm for mobile robots. Technical Report CIS-9517","author":"Kamon, I.","year":"1995"},{"key":"atypb9","doi-asserted-by":"crossref","unstructured":"Khatib, O. 1985. Real-time obstacle avoidance for manipulators and mobile robots. Proc. of the Int. Conf. on Robot. and Automat Los Alamitos, CA: IEEE, pp. 500-505.","DOI":"10.1109\/ROBOT.1985.1087247"},{"key":"atypb10","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-3652-9"},{"key":"atypb11","doi-asserted-by":"publisher","DOI":"10.1177\/027836499201100409"},{"key":"atypb12","doi-asserted-by":"publisher","DOI":"10.1109\/70.68070"},{"key":"atypb13","doi-asserted-by":"publisher","DOI":"10.1109\/21.59969"},{"key":"atypb14","doi-asserted-by":"crossref","unstructured":"Lumelsky, V.J., and Stepanov, A.A. 1987. Path-planning strategies for a point mobile automaton moving amidst obstacles of arbitrary shape Algorithmica 2:403-430.","DOI":"10.1007\/BF01840369"},{"key":"atypb15","first-page":"1425","author":"Noborio, H.","year":"1993","journal-title":"Proc. Conf. Intell. Robots and Sys., IROS"},{"key":"atypb16","first-page":"178","author":"Reignier,P.","year":"1994","journal-title":"Proc. of the Int. Symp. on Robot. Sys."},{"key":"atypb17","first-page":"2192","author":"Rencken, W.D.","year":"1993","journal-title":"Proc. of the Conf. on Intell. Robot. and Sys., IROS"},{"key":"atypb18","doi-asserted-by":"publisher","DOI":"10.1007\/BF02523678"},{"key":"atypb19","doi-asserted-by":"crossref","unstructured":"Sankaranarayanan, A., and Vidyasagar, M. 1991 (Sacramento, CA). Path planning for moving a point object amidst unknown obstacles in a plane: The universal lower bound on worst-case path lengths and a classification of algorithms. Proc. of the Int. Conf. on Robot. and Automat Los Alamitos, CA: IEEE, pp. 1734-1941.","DOI":"10.1109\/ROBOT.1991.131871"},{"key":"atypb20","unstructured":"Stentz, A. 1994 (San Diego, CA). Optimal and efficient path planning for partially known environments. Proc. of the Int. Conf. on Robot. and Automat Los Alamitos, CA: IEEE, pp. 3310-3317."}],"container-title":["The International Journal of Robotics Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/027836499801700903","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/027836499801700903","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T10:15:42Z","timestamp":1777457742000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.1177\/027836499801700903"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,9]]},"references-count":20,"journal-issue":{"issue":"9","published-print":{"date-parts":[[1998,9]]}},"alternative-id":["10.1177\/027836499801700903"],"URL":"https:\/\/doi.org\/10.1177\/027836499801700903","relation":{},"ISSN":["0278-3649","1741-3176"],"issn-type":[{"value":"0278-3649","type":"print"},{"value":"1741-3176","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998,9]]}}}