{"id":"https://openalex.org/W2122312633","doi":"https://doi.org/10.1142/s0218195913500027","title":"COMPUTING PUSH PLANS FOR DISK-SHAPED ROBOTS","display_name":"COMPUTING PUSH PLANS FOR DISK-SHAPED ROBOTS","publication_year":2013,"publication_date":"2013-02-01","ids":{"openalex":"https://openalex.org/W2122312633","doi":"https://doi.org/10.1142/s0218195913500027","mag":"2122312633"},"language":"en","primary_location":{"id":"doi:10.1142/s0218195913500027","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218195913500027","pdf_url":null,"source":{"id":"https://openalex.org/S25827807","display_name":"International Journal of Computational Geometry & Applications","issn_l":"0218-1959","issn":["0218-1959","1793-6357"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computational Geometry & Applications","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://research.tue.nl/nl/publications/cffb5aa0-5278-4611-8bc2-6c23a4c683e2","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5028410825","display_name":"Mark de Berg","orcid":"https://orcid.org/0000-0001-5770-3784"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"MARK DE BERG","raw_affiliation_strings":["Department of Mathematics and Computer Science, Technische Universiteit Eindhoven, Den Dolech 2, 5600 MB Eindhoven, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, Technische Universiteit Eindhoven, Den Dolech 2, 5600 MB Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5011199485","display_name":"Dirk H. P. Gerrits","orcid":null},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"DIRK H. P. GERRITS","raw_affiliation_strings":["Department of Mathematics and Computer Science, Technische Universiteit Eindhoven, Den Dolech 2, 5600 MB Eindhoven, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, Technische Universiteit Eindhoven, Den Dolech 2, 5600 MB Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5028410825"],"corresponding_institution_ids":["https://openalex.org/I83019370"],"apc_list":null,"apc_paid":null,"fwci":0.2722,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.62802869,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"23","issue":"01","first_page":"29","last_page":"48"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.987500011920929,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/object","display_name":"Object (grammar)","score":0.7312278747558594},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.7257214784622192},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.6902877688407898},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6490235328674316},{"id":"https://openalex.org/keywords/subroutine","display_name":"Subroutine","score":0.5301783084869385},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5168569684028625},{"id":"https://openalex.org/keywords/plan","display_name":"Plan (archaeology)","score":0.5135786533355713},{"id":"https://openalex.org/keywords/plane","display_name":"Plane (geometry)","score":0.4851185083389282},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.45987576246261597},{"id":"https://openalex.org/keywords/line","display_name":"Line (geometry)","score":0.45778313279151917},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4224073886871338},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38185960054397583},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.37925446033477783},{"id":"https://openalex.org/keywords/computer-vision","display_name":"Computer vision","score":0.35869917273521423},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2255707085132599},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.09405621886253357},{"id":"https://openalex.org/keywords/geography","display_name":"Geography","score":0.0606362521648407}],"concepts":[{"id":"https://openalex.org/C2781238097","wikidata":"https://www.wikidata.org/wiki/Q175026","display_name":"Object (grammar)","level":2,"score":0.7312278747558594},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.7257214784622192},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.6902877688407898},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6490235328674316},{"id":"https://openalex.org/C96147967","wikidata":"https://www.wikidata.org/wiki/Q190686","display_name":"Subroutine","level":2,"score":0.5301783084869385},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5168569684028625},{"id":"https://openalex.org/C2776505523","wikidata":"https://www.wikidata.org/wiki/Q4785468","display_name":"Plan (archaeology)","level":2,"score":0.5135786533355713},{"id":"https://openalex.org/C17825722","wikidata":"https://www.wikidata.org/wiki/Q17285","display_name":"Plane (geometry)","level":2,"score":0.4851185083389282},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.45987576246261597},{"id":"https://openalex.org/C198352243","wikidata":"https://www.wikidata.org/wiki/Q37105","display_name":"Line (geometry)","level":2,"score":0.45778313279151917},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4224073886871338},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38185960054397583},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.37925446033477783},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.35869917273521423},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2255707085132599},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.09405621886253357},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0606362521648407},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C166957645","wikidata":"https://www.wikidata.org/wiki/Q23498","display_name":"Archaeology","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":8,"locations":[{"id":"doi:10.1142/s0218195913500027","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218195913500027","pdf_url":null,"source":{"id":"https://openalex.org/S25827807","display_name":"International Journal of Computational Geometry & Applications","issn_l":"0218-1959","issn":["0218-1959","1793-6357"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computational Geometry & Applications","raw_type":"journal-article"},{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/c413ccce-4b6c-4017-b416-63d1f4d57876","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/c413ccce-4b6c-4017-b416-63d1f4d57876","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Berg, de, M T & Gerrits, D H P 2013, 'Computing push plans for disk-shaped robots', International Journal of Computational Geometry and Applications, vol. 23, no. 1, pp. 29-48. https://doi.org/10.1142/S0218195913500027","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:pure.tue.nl:publications/cffb5aa0-5278-4611-8bc2-6c23a4c683e2","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/cffb5aa0-5278-4611-8bc2-6c23a4c683e2","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:tue:oai:library.tue.nl:664994","is_oa":false,"landing_page_url":"http://repository.tue.nl/664994","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/other"},{"id":"pmh:tue:oai:library.tue.nl:675715","is_oa":false,"landing_page_url":"http://repository.tue.nl/675715","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/other"},{"id":"pmh:tue:oai:library.tue.nl:750653","is_oa":false,"landing_page_url":"http://repository.tue.nl/750653","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"International Journal of Computational Geometry and Applications International Journal of Computational Geometry and Applications, 23(1), 29","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:tue:oai:pure.tue.nl:publications/c413ccce-4b6c-4017-b416-63d1f4d57876","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/c413ccce-4b6c-4017-b416-63d1f4d57876","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"International Journal of Computational Geometry and Applications, 23(1), 29 - 48. World Scientific","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:tue:oai:pure.tue.nl:publications/cffb5aa0-5278-4611-8bc2-6c23a4c683e2","is_oa":true,"landing_page_url":"https://research.tue.nl/nl/publications/cffb5aa0-5278-4611-8bc2-6c23a4c683e2","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Abstracts 25th European Workshop on Computational Geometry (EuroCG'09, Brussels, Belgium, March 16-18, 2009), 49 - 52","raw_type":"info:eu-repo/semantics/conferencepaper"}],"best_oa_location":{"id":"pmh:tue:oai:pure.tue.nl:publications/cffb5aa0-5278-4611-8bc2-6c23a4c683e2","is_oa":true,"landing_page_url":"https://research.tue.nl/nl/publications/cffb5aa0-5278-4611-8bc2-6c23a4c683e2","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Abstracts 25th European Workshop on Computational Geometry (EuroCG'09, Brussels, Belgium, March 16-18, 2009), 49 - 52","raw_type":"info:eu-repo/semantics/conferencepaper"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1969997010","https://openalex.org/W1979838628","https://openalex.org/W1980092773","https://openalex.org/W1992334367","https://openalex.org/W2060506423","https://openalex.org/W2098030884","https://openalex.org/W2099372716","https://openalex.org/W2132339863","https://openalex.org/W2146897746"],"related_works":["https://openalex.org/W2975200075","https://openalex.org/W2007544051","https://openalex.org/W2061090284","https://openalex.org/W2075753041","https://openalex.org/W16307331","https://openalex.org/W2314667017","https://openalex.org/W3120046516","https://openalex.org/W4309209705","https://openalex.org/W2122312633","https://openalex.org/W2032114043"],"abstract_inverted_index":{"Suppose":[0],"we":[1],"want":[2],"to":[3,28,74,112],"move":[4],"a":[5,9,30,71,77,97],"passive":[6],"object":[7,38,91,117],"along":[8],"given":[10,61],"path,":[11],"among":[12],"obstacles":[13,45],"in":[14,70],"the":[15,34,37,44,52,84,90,106,116,130,134],"plane,":[16],"by":[17],"pushing":[18],"it":[19],"with":[20,89],"an":[21],"active":[22],"robot.":[23],"We":[24],"present":[25],"two":[26],"algorithms":[27,63],"compute":[29,75],"push":[31],"plan":[32],"for":[33],"case":[35],"that":[36,83,129],"and":[39,43,55,95],"robot":[40,85,107],"are":[41,46,101],"disks":[42],"non-intersecting":[47],"line":[48],"segments.":[49],"(When":[50],"only":[51],"object's":[53],"destination":[54],"not":[56],"its":[57],"full":[58],"path":[59,132],"is":[60,133],"these":[62],"can":[64],"still":[65],"be":[66],"used":[67],"as":[68],"subroutines":[69],"larger":[72],"algorithm":[73,81,121],"such":[76,123],"path.)":[78],"The":[79],"first":[80],"assumes":[82],"must":[86],"maintain":[87],"contact":[88],"at":[92],"all":[93],"times,":[94],"produces":[96],"shortest":[98,135],"path.":[99],"There":[100],"also":[102],"situations,":[103],"however,":[104],"where":[105],"has":[108],"no":[109,126],"choice":[110],"but":[111,125],"let":[113],"go":[114],"of":[115],"occasionally.":[118],"Our":[119],"second":[120],"handles":[122],"cases,":[124],"longer":[127],"guarantees":[128],"produced":[131],"possible.":[136]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":4},{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2016-06-24T00:00:00"}