{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T08:03:52Z","timestamp":1761293032946,"version":"3.40.4"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[2013,3,1]],"date-time":"2013-03-01T00:00:00Z","timestamp":1362096000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Math Artif Intell"],"published-print":{"date-parts":[[2013,3]]},"DOI":"10.1007\/s10472-013-9357-7","type":"journal-article","created":{"date-parts":[[2013,5,14]],"date-time":"2013-05-14T08:31:21Z","timestamp":1368520281000},"page":"251-281","source":"Crossref","is-referenced-by-count":23,"title":["Invariants for homology classes with application to optimal search and planning problem in robotics"],"prefix":"10.1007","volume":"67","author":[{"given":"Subhrajit","family":"Bhattacharya","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Lipsky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Ghrist","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vijay","family":"Kumar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,5,15]]},"reference":[{"key":"9357_CR1","doi-asserted-by":"crossref","unstructured":"Baylis, W.E.: Clifford (Geometric) Algebras with Applications in Physics, Mathematics, and Engineering, 1st edn. Birkhuser Boston (1996)","DOI":"10.1007\/978-1-4612-4104-1"},{"key":"9357_CR2","unstructured":"Bhattacharya, S.: A template-based C+\u2009+ library for large-scale graph search and planning (2011). See http:\/\/subhrajit.net\/index.php?WPage=yagsbpl"},{"issue":"3","key":"9357_CR3","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/s10514-012-9304-1","volume":"33","author":"S. Bhattacharya","year":"2012","unstructured":"Bhattacharya, S., Likhachev, M., Kumar, V.: Topological constraints in search-based robot path planning. Auton. Robot. 33(3), 273\u2013290 (2012). doi: 10.1007\/s10514-012-9304-1","journal-title":"Auton. Robot."},{"key":"9357_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-3951-0","volume-title":"Differential Forms in Algebraic Topology, Graduate Texts in Mathematics","author":"R. Bott","year":"1982","unstructured":"Bott, R., Tu, L.: Differential Forms in Algebraic Topology, Graduate Texts in Mathematics. Springer-Verlag, Heidelberg (1982)"},{"key":"9357_CR5","doi-asserted-by":"crossref","unstructured":"Bourgault, F., Makarenko, A.A., Williams, S.B., Grocholsky, B., Durrant-Whyte, H.F.: Information based adaptive robotic exploration. In: Proceedings IEEE\/RSJ International Conference on Intelligent Robots and Systems IROS, pp. 540\u2013545 (2002)","DOI":"10.1109\/IRDS.2002.1041446"},{"key":"9357_CR6","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1090\/S0273-0979-09-01249-X","volume":"46","author":"G. Carlsson","year":"2009","unstructured":"Carlsson, G.: Topology and data. Bull. Amer. Math. Soc. 46, 255\u2013308 (2009)","journal-title":"Bull. Amer. Math. Soc."},{"key":"9357_CR7","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge, (2001)","edition":"2"},{"key":"9357_CR8","unstructured":"Demyen, D., Buro, M.: Efficient triangulation-based pathfinding. In: AAAI\u201906: Proceedings of the 21st National Conference on Artificial intelligence. AAAI Press, pp. 942\u2013947 (2006)"},{"key":"9357_CR9","doi-asserted-by":"crossref","unstructured":"Derenick, J., Kumar, V., Jadbabaie, A.: Towards simplicial coverage repair for mobile robot teams. In: Proceedings of IEEE International Conference on Robotics and Automation (ICRA), pp. 5472\u20135477 (2010)","DOI":"10.1109\/ROBOT.2010.5509808"},{"key":"9357_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-67821-9","volume-title":"Lectures on Algebraic topology, Classics in Mathematics","author":"A. Dold","year":"1995","unstructured":"Dold, A.: Lectures on Algebraic topology, Classics in Mathematics. 2nd edn. Springer, Heidelberg (1995)","edition":"2"},{"key":"9357_CR11","doi-asserted-by":"crossref","unstructured":"Edelsbrunner, H., Harer, J.: Computational Topology: An Introduction, Applied Mathematics. American Mathematical Society (2010)","DOI":"10.1090\/mbk\/069"},{"key":"9357_CR12","unstructured":"Farber, M.: Topological complexity of motion planning. ArXiv Mathematics e-prints. arXiv: math\/0111197 (2001)"},{"key":"9357_CR13","doi-asserted-by":"crossref","first-page":"939","DOI":"10.1002\/rob.20265","volume":"25","author":"D. Ferguson","year":"2008","unstructured":"Ferguson, D., Howard, T., Likhachev, M.: Motion planning in urban environments. J. Field Robot. 25, 939\u2013960 (2008)","journal-title":"J. Field Robot."},{"key":"9357_CR14","volume-title":"Differential Forms with Applications to the Physical Sciences","author":"H. Flanders","year":"1989","unstructured":"Flanders, H.: Differential Forms with Applications to the Physical Sciences. Dover Publications, New York (1989)"},{"key":"9357_CR15","unstructured":"Galassi, M., Davies, J., Theiler, J., Gough, B., Jungman, G., Booth, M., Rossi, F.: Gnu Scientific Library: Reference Manual. Network Theory Ltd. (2003)"},{"key":"9357_CR16","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1090\/S0273-0979-07-01191-3","volume":"45","author":"R. Ghrist","year":"2008","unstructured":"Ghrist, R.: Barcodes: the persistent topology of data. Bull. Amer. Math. Soc. 45, 61\u201375 (2008)","journal-title":"Bull. Amer. Math. Soc."},{"key":"9357_CR17","unstructured":"Ghrist, R.: Configuration spaces of graphs and robotics. In: Braids, Links, and Mapping Class Groups: The Proceedings of Joan Birman\u2019s 70th Birthday, vol. 24, pp. 29\u201340. AMS\/IP Studies in Mathematics (2001)"},{"key":"9357_CR18","doi-asserted-by":"crossref","first-page":"1556","DOI":"10.1137\/S0363012900368442","volume":"40","author":"R. Ghrist","year":"2002","unstructured":"Ghrist, R., Koditschek, D.: Safe cooperative robot dynamics on graphs. SIAM J Contr Optim. 40, 1556\u20131575 (2002)","journal-title":"SIAM J Contr Optim."},{"issue":"5","key":"9357_CR19","doi-asserted-by":"crossref","first-page":"1697","DOI":"10.1137\/040609860","volume":"45","author":"R. Ghrist","year":"2006","unstructured":"Ghrist, R., LaValle, S.: Nonpositive curvature and pareto optimal motion planning. SIAM J. Contr. Optim. 45(5), 1697\u20131713 (2006)","journal-title":"SIAM J. Contr. Optim."},{"key":"9357_CR20","doi-asserted-by":"crossref","unstructured":"Ghrist, R., Muhammad, A: Coverage and hole-detection in sensor networks via homology. In: Proceedings of the Fourth International Symposium on Information Processing in Sensor Networks, IPSN 2005, 25\u201327 Apr 2005, pp. 254\u2013260. UCLA, Los Angeles, California, USA, IEEE (2005)","DOI":"10.1109\/IPSN.2005.1440933"},{"key":"9357_CR21","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/BF00047283","volume":"11","author":"D.H. Gottlieb","year":"1988","unstructured":"Gottlieb, D.H.: Topology and the robot arm. Acta Appl. Math. 11, 117\u2013121 (1988)","journal-title":"Acta Appl. Math."},{"key":"9357_CR22","doi-asserted-by":"crossref","unstructured":"Grigoriev, D., Slissenko, A.: Polytime algorithm for the shortest path in a homotopy class amidst semi-algebraic obstacles in the plane. In: Proceedings of the 1998 International Symposium on Symbolic and Algebraic Computation, ISSAC \u201998, pp. 17\u201324. ACM: New York, NY, USA (1998)","DOI":"10.1145\/281508.281528"},{"key":"9357_CR23","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"P.E. Hart","year":"1968","unstructured":"Hart, P.E., Nilsson, N.J., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Sci, Cybern. SSC 4, 100\u2013107 (1968)","journal-title":"IEEE Trans. Syst. Sci, Cybern. SSC"},{"key":"9357_CR24","unstructured":"Hatcher, A.: Algebraic Topology. Cambridge University Press (2001)"},{"key":"9357_CR25","first-page":"331","volume":"4","author":"J. Hershberger","year":"1991","unstructured":"Hershberger, J., Snoeyink, J.: Computing minimum length paths of a given homotopy class. Comput. Geom. Theory Appl. 4, 331\u2013342 (1991)","journal-title":"Comput. Geom. Theory Appl."},{"key":"9357_CR26","unstructured":"Jeffrey, A.: Handbook of Mathematical Formulas and Integrals, 2nd edn. Academic Press (2000)"},{"key":"9357_CR27","doi-asserted-by":"crossref","unstructured":"Kaczynski, T., Mischaikow, K., Mrozek, M.: Computational Homology. Applied Mathematical Sciences, Springer (2004)","DOI":"10.1007\/b97315"},{"key":"9357_CR28","unstructured":"Koenig, S., Likhachev, M.: D* Lite. In: Proceedings of the Eighteenth National Conference on Artificial Intelligence (AAAI), pp. 476\u2013483 (2002)"},{"key":"9357_CR29","unstructured":"Lavalle, S.M.: Rapidly-exploring random trees: a new tool for path planning. tech. report (1998)"},{"key":"9357_CR30","volume-title":"Advances in Neural Information Processing Systems (NIPS) 16","author":"M. Likhachev","year":"2003","unstructured":"Likhachev, M., Gordon, G., Thrun, S.: ARA*: Anytime A* with provable bounds on sub-optimality. In: Advances in Neural Information Processing Systems (NIPS) 16. Cambridge, MA: MIT Press (2003)"},{"key":"9357_CR31","unstructured":"Lum, P.Y., Singh, G., Lehman, A., Ishkanov, T., Vejdemo-Johansson, M., Alagappan, M., Carlsson, J., Carlsson, G.: Extracting insights from the shape of complex data using topology. Sci. Rep. 3 (2013). http:\/\/www.ncbi.nlm.nih.gov\/pubmed\/23393618"},{"key":"9357_CR32","doi-asserted-by":"crossref","first-page":"604","DOI":"10.1145\/355580.369102","volume":"5","author":"W.M. McKeeman","year":"1962","unstructured":"McKeeman, W.M.: Algorithm 145: adaptive numerical integration by simpson\u2019s rule. Commun. ACM 5, 604 (1962)","journal-title":"ACM"},{"key":"9357_CR33","doi-asserted-by":"crossref","unstructured":"Mrozek, M.: Topological dynamics: Rigorous numerics ia cubical homology. In: Zomorodian, A. (ed.) Advances in Applied and Computational Topology: Proc. Symp. Amer. Math. Soc., vol. 70, pp. 41\u201373 (2012)","DOI":"10.1090\/psapm\/070\/588"},{"key":"9357_CR34","unstructured":"Rudin, W.: Principles of Mathematical Analysis. International Series in Pure and Applied Mathematics. McGraw-Hill (1964)"},{"key":"9357_CR35","unstructured":"Sanderson, C.: Armadillo: an open source c++ linear algebra library for fast prototyping and computationally intensive experiments. tech, report, NICTA (2010)"},{"key":"9357_CR36","doi-asserted-by":"crossref","unstructured":"Schmitzberger, E., Bouchet, J., Dufaut, M., Wolf, D., Husson, R.: Capture of homotopy classes with probabilistic road map. In: International Conference on Intelligent Robots and Systems, vol. 3, pp. 2317\u20132322 (2002)","DOI":"10.1109\/IRDS.2002.1041613"},{"key":"9357_CR37","unstructured":"Seifert, H., Threlfall, W., Birman, J., Eisner, J.: Seifert and Threlfall, A textbook of Topology. Pure and Applied Mathematics, Academic Press (1980)"},{"key":"9357_CR38","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF00735431","volume":"2","author":"A. Stentz","year":"1995","unstructured":"Stentz, A., Hebert, M.: A complete navigation system for goal acquisition in unknown environments. Auton. Robot. 2, 127\u2013145 (1995)","journal-title":"Auton. Robot."},{"key":"9357_CR39","unstructured":"Thrun, S., Burgard, W., Fox, D.: Probabilistic Robotics Intelligent Robotics and Autonomous Agents. The MIT Press (2005)"},{"key":"9357_CR40","unstructured":"Wynn, P.: (1962) Acceleration techniques in numerical analysis, with particular reference to problems in one independent variable. In: Proc. IFIPS, pp. 149\u2013156. Munich (1962)"},{"key":"9357_CR41","doi-asserted-by":"crossref","unstructured":"Zhou, Y., Hu, B., Zhang, J.: Occlusion detection and tracking method based on bayesian decision theory. In: Chang, L.-W., Lie, W.-N. (eds.) Advances in Image and Video Technology. Lecture Notes in Computer Science, vol. 4319, pp. 474\u2013482. Springer Berlin\/Heidelberg (2006)","DOI":"10.1007\/11949534_47"}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-013-9357-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10472-013-9357-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-013-9357-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T09:56:47Z","timestamp":1746007007000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10472-013-9357-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,3]]},"references-count":41,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2013,3]]}},"alternative-id":["9357"],"URL":"https:\/\/doi.org\/10.1007\/s10472-013-9357-7","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"type":"print","value":"1012-2443"},{"type":"electronic","value":"1573-7470"}],"subject":[],"published":{"date-parts":[[2013,3]]}}}