{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T16:13:57Z","timestamp":1762100037695,"version":"3.44.0"},"reference-count":91,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1988,12,1]],"date-time":"1988-12-01T00:00:00Z","timestamp":596937600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1988,12,1]],"date-time":"1988-12-01T00:00:00Z","timestamp":596937600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2004,2,11]],"date-time":"2004-02-11T00:00:00Z","timestamp":1076457600000},"content-version":"vor","delay-in-days":5550,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Artificial Intelligence"],"published-print":{"date-parts":[[1988,12]]},"DOI":"10.1016\/0004-3702(88)90054-9","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T08:02:52Z","timestamp":1047628972000},"page":"171-201","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":83,"title":["An algorithmic approach to some problems in terrain navigation"],"prefix":"10.1016","volume":"37","author":[{"given":"Joseph S.B.","family":"Mitchell","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"article-title":"Shortest paths avoiding polyhedral obstacles in 3-dimensional Euclidean space","year":"1985","author":"Akman","key":"10.1016\/0004-3702(88)90054-9_BIB1"},{"key":"10.1016\/0004-3702(88)90054-9_BIB2","article-title":"Unobstructed shortest paths in polyhedral environments","volume":"251","author":"Akman","year":"1987"},{"key":"10.1016\/0004-3702(88)90054-9_BIB3","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/BF01840436","article-title":"Visibility of disjoint polygons","volume":"1","author":"Asano","year":"1986","journal-title":"Algorithmica"},{"key":"10.1016\/0004-3702(88)90054-9_BIB4","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/0020-0190(87)90150-5","article-title":"Shortest paths between two simple polygons","volume":"24","author":"Asano","year":"1987","journal-title":"Inf. Process. Lett."},{"key":"10.1016\/0004-3702(88)90054-9_BIB5","series-title":"Proceedings SIAM Conference on Geometric Modeling and Robotics","article-title":"Shortest paths with unit clearance among polygonal obstacles","author":"Baker","year":"1985"},{"key":"10.1016\/0004-3702(88)90054-9_BIB6","series-title":"AFIPS Conference Proceedings 44, National Computer Conference","first-page":"589","article-title":"A polyhedron representation for computer vision","author":"Baumgart","year":"1975"},{"issue":"3","key":"10.1016\/0004-3702(88)90054-9_BIB7","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1109\/TSMC.1983.6313112","article-title":"Solving the find-path problem by good representation of free space","volume":"13","author":"Brooks","year":"1983","journal-title":"IEEE Trans. Syst. Man Cybern."},{"issue":"2","key":"10.1016\/0004-3702(88)90054-9_BIB8","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1109\/TSMC.1985.6313352","article-title":"A subdivision algorithm in the configuration space for find path with rotation","volume":"15","author":"Brooks","year":"1985","journal-title":"IEEE Trans. Syst. Man Cybern."},{"article-title":"The complexity of robot motion planning","year":"1987","author":"Canny","key":"10.1016\/0004-3702(88)90054-9_BIB9"},{"key":"10.1016\/0004-3702(88)90054-9_BIB10","series-title":"Proceedings 28th Annual IEEE Symposium on Foundations of Computer Science","first-page":"49","article-title":"New lower bound techniques for robot motion planning problems","author":"Canny","year":"1987"},{"key":"10.1016\/0004-3702(88)90054-9_BIB11","series-title":"Proceedings First Annual ACM Conference on Computational Geometry","first-page":"214","article-title":"Planning the shortest path for a disk in O(n2 log n) time","author":"Chew","year":"1985"},{"key":"10.1016\/0004-3702(88)90054-9_BIB12","series-title":"Proceedings 2nd ACM Symposium on Computational Geometry","first-page":"24","article-title":"Optimum watchman routes","author":"Chin","year":"1986"},{"article-title":"Watchman routes in simple polygons","year":"1987","author":"Chin","key":"10.1016\/0004-3702(88)90054-9_BIB13"},{"key":"10.1016\/0004-3702(88)90054-9_BIB14","series-title":"Proceedings 19th Annual ACM Symposium on Theory of Computing","first-page":"56","article-title":"Approximation algorithms for shortest path motion planning","author":"Clarkson","year":"1987"},{"key":"10.1016\/0004-3702(88)90054-9_BIB15","series-title":"Proceedings Third Annual ACM Conference on Computational Geometry","first-page":"251","article-title":"Rectilinear shortest paths through polygonal obstacles in O(n log2n) time","author":"Clarkson","year":"1987"},{"key":"10.1016\/0004-3702(88)90054-9_BIB16","series-title":"Proceedings Second GI Conference on Automata Theory and Formal Languages","first-page":"134","article-title":"Quantifier elimination for real closed fields by cylindric algebraic decomposition","volume":"33","author":"Collins","year":"1975"},{"key":"10.1016\/0004-3702(88)90054-9_BIB17","series-title":"Proceedings First ACM Conference on Computational Geometry","first-page":"204","article-title":"Rectilinear shortest paths with rectangular barriers","author":"de Rezende","year":"1985"},{"key":"10.1016\/0004-3702(88)90054-9_BIB18","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","article-title":"A note on two problems in connection with graphs","volume":"1","author":"Dijkstra","year":"1959","journal-title":"Numer. Math."},{"year":"1987","author":"Edelsbrunner","key":"10.1016\/0004-3702(88)90054-9_BIB19"},{"key":"10.1016\/0004-3702(88)90054-9_BIB20","series-title":"Proceedings 22nd Allerton Conference on Communication, Control and Computing","first-page":"103","article-title":"Shortest paths between source and goal points located on\/around a convex polyhedron","author":"Franklin","year":"1984"},{"key":"10.1016\/0004-3702(88)90054-9_BIB21","series-title":"Proceedings 25th Annual IEEE Symposium on Foundations of Computer Science","first-page":"338","article-title":"Fibonacci heaps and their uses in improved network optimization algorithms","author":"Fredman","year":"1984"},{"key":"10.1016\/0004-3702(88)90054-9_BIB22","series-title":"Proceedings Fourth Annual ACM Conference on Computational Geometry","first-page":"266","article-title":"Path planning in 0\/1\/\u221e weighted regions with applications, Extended Abstract","author":"Gewali","year":"1988"},{"key":"10.1016\/0004-3702(88)90054-9_BIB23","series-title":"Proceedings 28th Annual IEEE Symposium on Foundations of Computer Science","first-page":"11","article-title":"An output sensitive algorithm for computing visibility graphs","author":"Ghosh","year":"1987"},{"article-title":"3-D world modeling with updating capability based on combinatorial geometry","year":"1987","author":"Goldstein","key":"10.1016\/0004-3702(88)90054-9_BIB24"},{"key":"10.1016\/0004-3702(88)90054-9_BIB25","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/BF01840360","article-title":"Linear time algorithms for visibility and shortest path problems inside simple polygons","volume":"2","author":"Guibas","year":"1987","journal-title":"Algorithmica"},{"key":"10.1016\/0004-3702(88)90054-9_BIB26","series-title":"Proceedings Third Annual ACM Conference on Computational Geometry","first-page":"50","article-title":"Optimal shortest path queries in a simple polygon","author":"Guibas","year":"1987"},{"key":"10.1016\/0004-3702(88)90054-9_BIB27","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1145\/282918.282923","article-title":"Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams","volume":"4","author":"Guibas","year":"1985","journal-title":"ACM Trans. Graph."},{"key":"10.1016\/0004-3702(88)90054-9_BIB28","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1017\/S0263574700008559","article-title":"Robot navigation algorithms using learned spatial graphs","volume":"4","author":"Iyengar","year":"1986","journal-title":"Robotica"},{"issue":"2","key":"10.1016\/0004-3702(88)90054-9_BIB29","article-title":"Solving problems involving variable terrain, Part 1: A general algorithm","volume":"5","author":"Jones","year":"1980","journal-title":"BYTE"},{"issue":"1","key":"10.1016\/0004-3702(88)90054-9_BIB30","first-page":"223","article-title":"Autonomous robot navigation","volume":"11","author":"Jorgensen","year":"1986","journal-title":"BYTE"},{"issue":"3","key":"10.1016\/0004-3702(88)90054-9_BIB31","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1109\/JRA.1986.1087051","article-title":"Multiresolution path planning for mobile robots","volume":"2","author":"Kambhampati","year":"1986","journal-title":"IEEE J. Rob. Autom."},{"issue":"3","key":"10.1016\/0004-3702(88)90054-9_BIB32","first-page":"38","article-title":"An algorithmic approach to intelligent robot mobility","volume":"5","author":"Kauffman","year":"1983","journal-title":"Rob. Age"},{"key":"10.1016\/0004-3702(88)90054-9_BIB33","article-title":"Planning strategic paths through variable terrain data","volume":"485","author":"Keirsey","year":"1984"},{"key":"10.1016\/0004-3702(88)90054-9_BIB34","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1137\/0212002","article-title":"Optimal search in planar subdivisions","volume":"12","author":"Kirkpatrick","year":"1983","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0004-3702(88)90054-9_BIB35","series-title":"Proceedings First IEEE Conference of Artificial Intelligence Applications","first-page":"578","article-title":"Terrain map knowledge representation for spatial planning","author":"Kuan","year":"1984"},{"key":"10.1016\/0004-3702(88)90054-9_BIB36","series-title":"Proceedings First IEEE Conference of Artificial Intelligence Applications","first-page":"70","article-title":"Automatic path planning for a mobile robot using a mixed representation of free space","author":"Kuan","year":"1984"},{"key":"10.1016\/0004-3702(88)90054-9_BIB37","series-title":"Proceedings IEEE International Conference on Robotics and Automation","first-page":"168","article-title":"Natural decomposition of free space for path planning","author":"Kuan","year":"1985"},{"key":"10.1016\/0004-3702(88)90054-9_BIB38","series-title":"Ph.D. Thesis","article-title":"Proximity and reachability in the plane","author":"Lee","year":"1978"},{"key":"10.1016\/0004-3702(88)90054-9_BIB39","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/0020-0190(85)90015-8","article-title":"The power of geometric duality revisited","volume":"21","author":"Lee","year":"1985","journal-title":"Inf. Process. Lett."},{"key":"10.1016\/0004-3702(88)90054-9_BIB40","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1002\/net.3230140304","article-title":"Euclidean shortest paths in the presence of rectilinear boundaries","volume":"14","author":"Lee","year":"1984","journal-title":"Networks"},{"issue":"10","key":"10.1016\/0004-3702(88)90054-9_BIB41","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1145\/359156.359164","article-title":"An algorithm for planning collision-free paths among polyhedral obstacles","volume":"22","author":"Lozano-P\u00e9rez","year":"1979","journal-title":"Comm. ACM"},{"key":"10.1016\/0004-3702(88)90054-9_BIB42","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1007\/BF01840369","article-title":"Path-planning strategies for a point mobile automaton moving amidst unknown obstacles of arbitrary shape","volume":"2","author":"Lumelsky","year":"1987","journal-title":"Algorithmica"},{"year":"1964","author":"Lyusternik","key":"10.1016\/0004-3702(88)90054-9_BIB43"},{"year":"1984","author":"Mehlhorn","key":"10.1016\/0004-3702(88)90054-9_BIB44"},{"article-title":"Free-space modeling and geometric motion planning under unexpected obstacles","year":"1987","author":"Meng","key":"10.1016\/0004-3702(88)90054-9_BIB45"},{"article-title":"Free-space modeling and path planning under uncertainty for autonomous air robots","year":"1987","author":"Meng","key":"10.1016\/0004-3702(88)90054-9_BIB46"},{"key":"10.1016\/0004-3702(88)90054-9_BIB47","series-title":"Proceedings IEEE International Conference on Robotics and Automation","article-title":"Route planning for intelligent autonomous land vehicles using hierarchical terrain representation","author":"Metea","year":"1987"},{"key":"10.1016\/0004-3702(88)90054-9_BIB48","first-page":"153","article-title":"An autonomous vehicle navigation algorithm","volume":"485","author":"Mitchell","year":"1984"},{"article-title":"Planning shortest paths","year":"1986","author":"Mitchell","key":"10.1016\/0004-3702(88)90054-9_BIB49_1"},{"year":"1986","key":"10.1016\/0004-3702(88)90054-9_BIB49_2"},{"article-title":"Shortest rectilinear paths among obstacles","year":"1987","author":"Mitchell","key":"10.1016\/0004-3702(88)90054-9_BIB50"},{"article-title":"Shortest paths among obstacles, zero-cost regions, and roads","year":"1987","author":"Mitchell","key":"10.1016\/0004-3702(88)90054-9_BIB51"},{"key":"10.1016\/0004-3702(88)90054-9_BIB52","series-title":"Proceedings Fourth Annual ACM Conference on Computational Geometry","first-page":"341","article-title":"On maximum flows in polyhedral domains, Extended Abstract","author":"Mitchell","year":"1988"},{"article-title":"On the maximum concealment problem","year":"1988","author":"Mitchell","key":"10.1016\/0004-3702(88)90054-9_BIB53"},{"issue":"4","key":"10.1016\/0004-3702(88)90054-9_BIB54","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1137\/0216045","article-title":"The discrete geodesic problem","volume":"16","author":"Mitchell","year":"1987","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0004-3702(88)90054-9_BIB55","series-title":"Proceedings SIAM Conference on Geometric Modeling and Robotics","article-title":"Planning shortest paths","author":"Mitchell","year":"1985"},{"article-title":"The weighted region problem","year":"1986","author":"Mitchell","key":"10.1016\/0004-3702(88)90054-9_BIB56_1"},{"year":"1987","series-title":"Proceedings Third Annual ACM Conference on Computational Geometry","key":"10.1016\/0004-3702(88)90054-9_BIB56_2"},{"key":"10.1016\/0004-3702(88)90054-9_BIB57","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1002\/int.4550020204","article-title":"Planning and reasoning for autonomous vehicle control","volume":"2","author":"Mitchell","year":"1987","journal-title":"Int. J. Intell. Syst."},{"article-title":"Obstacle avoidance and navigation in the real world by a seeing robot rover","year":"1980","author":"Moravec","key":"10.1016\/0004-3702(88)90054-9_BIB58"},{"year":"1980","author":"Nilsson","key":"10.1016\/0004-3702(88)90054-9_BIB59"},{"article-title":"Robot navigation in unknown terrains using learned visibility graphs, Part I: The disjoint convex obstacle case","year":"1986","author":"Oommen","key":"10.1016\/0004-3702(88)90054-9_BIB60"},{"article-title":"Finding a shortest ladder path: A special case","year":"1987","author":"O'Rourke","key":"10.1016\/0004-3702(88)90054-9_BIB61"},{"year":"1984","series-title":"Shortest paths on polyhedral surfaces","author":"O'Rourke","key":"10.1016\/0004-3702(88)90054-9_BIB62"},{"key":"10.1016\/0004-3702(88)90054-9_BIB63","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/0020-0190(85)90029-8","article-title":"An algorithm for shortest-path motion in three dimensions","volume":"20","author":"Papadimitriou","year":"1985","journal-title":"Inf. Process. Lett"},{"key":"10.1016\/0004-3702(88)90054-9_BIB64","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1007\/BF01840372","article-title":"Optimal piecewise linear motion of an object among obstacles","volume":"2","author":"Papadimitriou","year":"1987","journal-title":"Algorithmica"},{"year":"1985","author":"Preparata","key":"10.1016\/0004-3702(88)90054-9_BIB65"},{"key":"10.1016\/0004-3702(88)90054-9_BIB66","series-title":"Proceedings SPIE Applications of Artificial Intelligence","article-title":"A decision system for autonomous robot navigation over rough terrain","author":"Quek","year":"1985"},{"issue":"4","key":"10.1016\/0004-3702(88)90054-9_BIB67","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1002\/rob.4620030404","article-title":"Robot navigation in an unexplored terrain","volume":"3","author":"Rao","year":"1986","journal-title":"J. Rob. Syst."},{"key":"10.1016\/0004-3702(88)90054-9_BIB68","series-title":"Proceedings IEEE International Conference on Robotics and Automation","first-page":"1314","article-title":"On terrain acquisition by a finite-sized mobile robot in plane","author":"Rao","year":"1987"},{"article-title":"Shortest paths in Euclidean space with polyhedral obstacles","year":"1985","author":"Reif","key":"10.1016\/0004-3702(88)90054-9_BIB69"},{"article-title":"Solving a class of spatial reasoning problems: Minimal-cost path planning in the Cartesian plane","year":"1987","author":"Richbourg","key":"10.1016\/0004-3702(88)90054-9_BIB70"},{"key":"10.1016\/0004-3702(88)90054-9_BIB71","doi-asserted-by":"crossref","DOI":"10.1109\/ROBOT.1986.1087656","article-title":"Exploiting capability constraints to solve global, two-dimensional path planning problems","author":"Richbourg","year":"1986"},{"key":"10.1016\/0004-3702(88)90054-9_BIB72","series-title":"Proceedings IEEE International Conference on Robotics and Automation","first-page":"1631","article-title":"Solving global two-dimensional routing problems using Snell's law and A\u2217 search","author":"Richbourg","year":"1987"},{"article-title":"Roads, rivers, and rocks: Optimal two-dimensional route planning around linear features for a mobile robot","year":"1987","author":"Rowe","key":"10.1016\/0004-3702(88)90054-9_BIB73"},{"article-title":"A new method for optimal path planning through nonhomogeneous free space","year":"1987","author":"Rowe","key":"10.1016\/0004-3702(88)90054-9_BIB74"},{"issue":"2","key":"10.1016\/0004-3702(88)90054-9_BIB75","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1109\/TPAMI.1987.4767900","article-title":"Structuring free space as a hypergraph for roving robot path planning and navigation","volume":"9","author":"Rueb","year":"1987","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"3","key":"10.1016\/0004-3702(88)90054-9_BIB76","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1145\/282957.282966","article-title":"Storing a collection of polygons using quadtrees","volume":"4","author":"Samet","year":"1985","journal-title":"ACM Trans. Graph."},{"year":"1987","key":"10.1016\/0004-3702(88)90054-9_BIB77"},{"volume":"1","year":"1987","key":"10.1016\/0004-3702(88)90054-9_BIB78"},{"issue":"1","key":"10.1016\/0004-3702(88)90054-9_BIB79","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1137\/0215014","article-title":"On shortest paths in polyhedral spaces","volume":"15","author":"Sharir","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0004-3702(88)90054-9_BIB80","unstructured":"Smith, T., Private communication, Department of Computer Science, University of California, Santa Barbara, CA (1986)."},{"key":"10.1016\/0004-3702(88)90054-9_BIB81","series-title":"Ph.D. Thesis","article-title":"Computational geometry in a curved world","author":"Souvaine","year":"1986"},{"key":"10.1016\/0004-3702(88)90054-9_BIB82","series-title":"Impacts of Microcomputers on Operations Research","first-page":"73","article-title":"A routing algorithm for a mobile search robot","author":"Stern","year":"1986"},{"issue":"12","key":"10.1016\/0004-3702(88)90054-9_BIB83","doi-asserted-by":"crossref","first-page":"1092","DOI":"10.1109\/T-C.1969.222592","article-title":"A method for solving arbitrary wall mazes by computer","volume":"18","author":"Sutherland","year":"1969","journal-title":"IEEE Trans. Comput."},{"article-title":"An O(n log log n) algorithm for triangulating simple polygons","year":"1986","author":"Tarjan","key":"10.1016\/0004-3702(88)90054-9_BIB84"},{"key":"10.1016\/0004-3702(88)90054-9_BIB85","series-title":"Proceedings AAAI-84","first-page":"318","article-title":"Path relaxation: Path planning for a mobile robot","author":"Thorpe","year":"1984"},{"key":"10.1016\/0004-3702(88)90054-9_BIB86","series-title":"Ph.D. Thesis","article-title":"FIDO: Vision and navigation for a robot rover","author":"Thorpe","year":"1984"},{"key":"10.1016\/0004-3702(88)90054-9_BIB87","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0020-0190(85)90044-4","article-title":"Constructing the visibility graph for n line segments in O(n2) time","volume":"20","author":"Welzl","year":"1985","journal-title":"Inf. Process. Lett."},{"key":"10.1016\/0004-3702(88)90054-9_BIB88","series-title":"Proceedings First Annual ACM Conference on Computational Geometry","article-title":"Distance problems in computational geometry with fixed orientations","author":"Widmayer","year":"1985"},{"key":"10.1016\/0004-3702(88)90054-9_BIB89","unstructured":"Zikan, K., Private communication, Department of Operations Research, Stanford University, Stanford, CA (1986)."}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0004370288900549?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0004370288900549?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,3]],"date-time":"2025-09-03T14:19:42Z","timestamp":1756909182000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0004370288900549"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,12]]},"references-count":91,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1988,12]]}},"alternative-id":["0004370288900549"],"URL":"https:\/\/doi.org\/10.1016\/0004-3702(88)90054-9","relation":{},"ISSN":["0004-3702"],"issn-type":[{"type":"print","value":"0004-3702"}],"subject":[],"published":{"date-parts":[[1988,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"An algorithmic approach to some problems in terrain navigation","name":"articletitle","label":"Article Title"},{"value":"Artificial Intelligence","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0004-3702(88)90054-9","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1988 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}