{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T16:56:18Z","timestamp":1783184178502,"version":"3.54.6"},"reference-count":40,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2012,4,1]],"date-time":"2012-04-01T00:00:00Z","timestamp":1333238400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Robot."],"published-print":{"date-parts":[[2012,4]]},"DOI":"10.1109\/tro.2011.2172152","type":"journal-article","created":{"date-parts":[[2011,11,11]],"date-time":"2011-11-11T19:04:45Z","timestamp":1321038285000},"page":"427-439","source":"Crossref","is-referenced-by-count":90,"title":["Fast Humanoid Robot Collision-Free Footstep Planning Using Swept Volume Approximations"],"prefix":"10.1109","volume":"28","author":[{"given":"Nicolas","family":"Perrin","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Olivier","family":"Stasse","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"L\u00e9o","family":"Baudouin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Florent","family":"Lamiraux","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Eiichi","family":"Yoshida","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/ICHR.2005.1573536"},{"key":"ref38","first-page":"168","article-title":"A random sampling-based approach to goal-directed footstep planning for humanoid robots","author":"xia","year":"2009","journal-title":"Proc IEEE\/ASME Int Conf Adv Intell Mechatronics"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1080\/10867651.2004.10504891"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2011.5979917"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2010.5509395"},{"key":"ref30","year":"0"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1142\/S0219843604000083"},{"key":"ref36","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/978-3-642-17452-0_14","article-title":"CCQ: Efficient local planning using connection collision query","author":"tang","year":"2010","journal-title":"Proc 9th Workshop Algorithm Found Robot"},{"key":"ref35","article-title":"Kinodynamic motion planning by interior-exterior cell exploration","author":"sucan","year":"2008","journal-title":"Proc 8th Workshop Algorithm Found Robot"},{"key":"ref34","article-title":"Exact collision checking of robot paths","author":"schwarzer","year":"2002","journal-title":"Proc 5th Workshop Algorithmic Found Robot"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2009.5354572"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/1276377.1276396"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/344779.344899"},{"key":"ref12","article-title":"Search-based planning with provable suboptimality bounds for continuous state spaces","author":"gonzalez","year":"2011","journal-title":"Proc 4th Annu Symp Combinatorial Search"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84996-220-9_7"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1142\/S0219843606000643"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISATP.2003.1217221"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2010.5654429"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2008.2010553"},{"key":"ref18","article-title":"Path deformation roadmaps","author":"jaillet","year":"2006","journal-title":"Proc 7th Workshop Algorithmic Found Robot"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2003.1241826"},{"key":"ref28","first-page":"902","article-title":"Generation of reactive stepping motion for a humanoid by dynamically stable mixture of pre-designed motions","author":"nishiwaki","year":"1999","journal-title":"Proc IEEE Int Conf Syst Man Cybern"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/IRDS.2002.1041646"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1177\/027836498700600103"},{"key":"ref3","first-page":"483","article-title":"Fast <formula formulatype=\"inline\"><tex Notation=\"TeX\">$c^1$<\/tex><\/formula> proximity queries using support mapping of sphere-torus-patches bounding volumes","author":"benallegue","year":"2009","journal-title":"Proc IEEE Int Conf Robot Autom"},{"key":"ref6","year":"0"},{"key":"ref29","first-page":"4110","article-title":"Online mixture and connection of basic motions for humanoid walking control by footprint specification","author":"nishiwaki","year":"2001","journal-title":"Proc IEEE Int Conf Robot Autom"},{"key":"ref5","author":"chestnutt","year":"2007","journal-title":"Navigation Planning for Legged Robots"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2006.1641817"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2005.1570188"},{"key":"ref2","year":"0"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ICHR.2007.4813868"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2006.282183"},{"key":"ref20","doi-asserted-by":"crossref","DOI":"10.15607\/RSS.2010.VI.034","article-title":"Incremental sampling-based algorithms for optimal motion planning","author":"karaman","year":"2010","journal-title":"Proc Robot Sci Syst VI Conf"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/781606.781613"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/70.508439"},{"key":"ref24","first-page":"3719","article-title":"Fast proximity queries with swept sphere volumes","author":"larsen","year":"2000","journal-title":"Proc IEEE Int Conf Robot Autom"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2001.973406"},{"key":"ref26","first-page":"293","article-title":"Rapidly-exploring random trees: Progress and prospects","author":"lavalle","year":"2000","journal-title":"Proc 4th Workshop Algorithmic Found Robot"},{"key":"ref25","year":"0"}],"container-title":["IEEE Transactions on Robotics"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8860\/6177749\/06078435.pdf?arnumber=6078435","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,10]],"date-time":"2021-10-10T23:52:43Z","timestamp":1633909963000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6078435\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,4]]},"references-count":40,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tro.2011.2172152","relation":{},"ISSN":["1552-3098","1941-0468"],"issn-type":[{"value":"1552-3098","type":"print"},{"value":"1941-0468","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,4]]}}}