{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T22:12:24Z","timestamp":1740175944814,"version":"3.37.3"},"reference-count":35,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2016,7,1]],"date-time":"2016-07-01T00:00:00Z","timestamp":1467331200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["IIS-0643476"],"award-info":[{"award-number":["IIS-0643476"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Robot. Autom. Lett."],"published-print":{"date-parts":[[2016,7]]},"DOI":"10.1109\/lra.2016.2524067","type":"journal-article","created":{"date-parts":[[2016,2,2]],"date-time":"2016-02-02T20:37:50Z","timestamp":1454445470000},"page":"1164-1171","source":"Crossref","is-referenced-by-count":5,"title":["-Survivability: Diversity and Survival of Expendable Robots"],"prefix":"10.1109","volume":"1","author":[{"given":"Yu-Han","family":"Lyu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yining","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Devin","family":"Balkcom","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1177\/027836402320556368"},{"key":"ref32","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/9407.001.0001","author":"murphy","year":"2014","journal-title":"Disaster Robotics"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/s10514-011-9241-4"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/s10732-011-9172-4"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/j.robot.2013.08.006"},{"key":"ref34","first-page":"493","article-title":"Opponent-driven planning and execution for pass, attack, and defense in a multi-robot soccer team","author":"biswas","year":"0","journal-title":"Proc Int Conf Auton Agents and Multi Agent Syst"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.2000.1145"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1111\/j.1538-4632.1987.tb00133.x"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.30.3.290"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1287\/opre.42.2.299"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2009.5152773"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1002\/nav.20165"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2011.6160385"},{"key":"ref17","article-title":"Optimal planning strategy for ambush avoidance","author":"boidot","year":"0","journal-title":"Proc Workshop Artif Intell Transp Advice Interactivity Actor Model Conf Artif Intell AAAI"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2014.08.002"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795289604"},{"key":"ref28","first-page":"2658","article-title":"Minimum-color path problems for reliability in mesh networks","author":"yuan","year":"0","journal-title":"Proc IEEE Int Conf Comput Commun INFOCOM"},{"article-title":"On the fundamental relationships among path planning alternatives","year":"2011","author":"knepper","key":"ref4"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(99)00214-3"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14743-2_24"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2013.6697226"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2014.04.009"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1177\/0278364911430418"},{"key":"ref8","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1109\/TNET.2005.863451","article-title":"On the complexity of and algorithms for finding the shortest path with a disjoint counterpart","volume":"14","author":"xu","year":"2006","journal-title":"IEEE\/ACM Trans Netw"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2015.7139774"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2009.5152696"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2003.10.033"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2008.4543392"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/s10514-012-9304-1"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.17.11.712"},{"key":"ref21","first-page":"1616","article-title":"Geometric k shortest paths","author":"eriksson-bique","year":"0","journal-title":"Proc SODA ACM-SIAM Symp Discrete Algorithms"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/0022-247X(66)90020-5"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230040204"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/s11235-013-9818-7"},{"key":"ref25","volume":"477","author":"bhandari","year":"1999","journal-title":"Survivable Networks Algorithms for Diverse Routing"}],"container-title":["IEEE Robotics and Automation Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7083369\/7419970\/7396947.pdf?arnumber=7396947","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:02:10Z","timestamp":1642003330000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7396947\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7]]},"references-count":35,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/lra.2016.2524067","relation":{},"ISSN":["2377-3766","2377-3774"],"issn-type":[{"type":"electronic","value":"2377-3766"},{"type":"electronic","value":"2377-3774"}],"subject":[],"published":{"date-parts":[[2016,7]]}}}