{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T13:18:19Z","timestamp":1762521499701},"reference-count":35,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","content-domain":{"domain":["ieeexplore.ieee.orgieee.org"],"crossmark-restriction":true},"short-container-title":["IEEE Trans. Automat. Contr."],"published-print":{"date-parts":[[2012,5]]},"DOI":"10.1109\/tac.2012.2191836","type":"journal-article","created":{"date-parts":[[2012,3,24]],"date-time":"2012-03-24T06:09:37Z","timestamp":1332569377000},"page":"1166-1178","update-policy":"http:\/\/dx.doi.org\/10.1109\/crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["A Beamlet-Based Graph Structure for Path Planning Using Multiscale Information"],"prefix":"10.1109","volume":"57","author":[{"family":"Yibiao Lu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Xiaoming Huo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Tsiotras","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","first-page":"476","article-title":"<ref_formula><tex Notation=\"TeX\">${\\rm D}^{\\ast}$<\/tex><\/ref_formula> lite","author":"koenig","year":"2002","journal-title":"Proc AAAI Conf Artif Intell (AAAI)"},{"key":"ref32","first-page":"99","article-title":"Incremental heuristic search in artificial intelligence","volume":"25","author":"koenig","year":"2004","journal-title":"Artif Intell Mag"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2003.12.001"},{"key":"ref30","article-title":"Breaking path symmetries on 4-connected grid maps","author":"harabor","year":"2010","journal-title":"Proc 6th Annu Int AIIDE Conf"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2011.2157493"},{"key":"ref34","first-page":"89","article-title":"Optimal and efficient path planning for unknown and dynamic environments","volume":"10","author":"stentz","year":"1995","journal-title":"Int J Robot Autom"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546877"},{"key":"ref11","author":"huo","year":"1999","journal-title":"Sparse image representation via combined transforms"},{"key":"ref12","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1117\/12.408630","article-title":"Beamlets pyramids: A new form of multiresolution analysis, suited for extracting lines, curves and objects from very noise image data","volume":"4119","author":"donoho","year":"2000","journal-title":"Proc SPIE"},{"key":"ref13","article-title":"Applications of beamlets to detection and extraction of lines, curves, and objects in very noisy images","author":"donoho","year":"2001","journal-title":"Proc Nonlin Signal Image Processing"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/321992.321993"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"key":"ref16","author":"cormen","year":"2001","journal-title":"Introduction to Algorithms"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.850056"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2005.857273"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1142\/S0219691304000615"},{"key":"ref28","first-page":"129","article-title":"Reach for <ref_formula><tex Notation=\"TeX\">${\\rm A}^{\\ast}$<\/tex><\/ref_formula>: Efficient point-to-point shortest path algorithms","author":"goldberg","year":"2006","journal-title":"Proc Workshop Algorithm Eng Exper"},{"key":"ref4","first-page":"156","article-title":"Computing the shortest path: <ref_formula> <tex Notation=\"TeX\">${\\rm A}^{\\ast}$<\/tex><\/ref_formula> search meets graph theory","author":"goldberg","year":"2005","journal-title":"Proc 16th ACM-SIAM Symp Discrete Algorithms"},{"key":"ref27","first-page":"76","article-title":"A comparison of high-level approaches for speeding up pathfinding","author":"sturtevant","year":"2010","journal-title":"Proc 6th Artif Intell Interactive Digital Entertainment Conf"},{"key":"ref3","first-page":"609","article-title":"Memory-based heuristics for explicit state spaces","author":"sturtevant","year":"2009","journal-title":"Proc Int Joint Conf Artif Intell"},{"key":"ref6","first-page":"127","volume":"6","author":"pohl","year":"1971","journal-title":"Machine Intelligence"},{"key":"ref29","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1609\/socs.v1i1.18169","article-title":"Portal-based true-distance heuristics for path finding","author":"goldenberg","year":"2010","journal-title":"Proc 3rd Annu Symp Combinatorial Search"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/322003.322004"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"ref7","article-title":"A guide to heuristic-based path planning","author":"ferguson","year":"2005","journal-title":"Proc Int Workshop Planning Under Uncertainty Auton Syst Int Conf Autom Planning Scheduling (ICAPS)"},{"key":"ref2","first-page":"74","article-title":"Abstraction-based heuristics with true distance computations","author":"felner","year":"2009","journal-title":"Proc 8th Symp Abstraction Reformulatoin Approx"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"key":"ref1","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/978-3-642-56205-1_3","article-title":"Beamlets and multiscale image analysis","volume":"20","author":"donoho","year":"2002","journal-title":"Multiscale and Multiresolution Methods"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/76.735380"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-73580-9_27"},{"key":"ref21","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1613\/jair.2293","article-title":"Graph abstraction in real-time heuristic search","volume":"30","author":"bulitko","year":"2007","journal-title":"J Artif Intell Res"},{"key":"ref24","first-page":"114","article-title":"Searching without a heuristic: Efficient use of abstraction","author":"larsen","year":"2010","journal-title":"Proc 24th AAAI Conf Artif Intell (AAAI-10)"},{"key":"ref23","first-page":"1392","article-title":"Partial pathfinding using map abstraction and refinement","volume":"20","author":"sturtevant","year":"2005","journal-title":"Proc Nat Conf Artif Intell"},{"key":"ref26","first-page":"1","article-title":"Near-optimal hierarchical pathfinding","volume":"1","author":"botea","year":"2004","journal-title":"J Game Development"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-68552-4_24"}],"container-title":["IEEE Transactions on Automatic Control"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/9\/6187742\/06174453.pdf?arnumber=6174453","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,21]],"date-time":"2023-06-21T11:56:54Z","timestamp":1687348614000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6174453\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5]]},"references-count":35,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2012,5]]}},"URL":"https:\/\/doi.org\/10.1109\/tac.2012.2191836","relation":{},"ISSN":["0018-9286","1558-2523"],"issn-type":[{"value":"0018-9286","type":"print"},{"value":"1558-2523","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,5]]}}}