{"id":"https://openalex.org/W3026174244","doi":"https://doi.org/10.1109/cis-ram47153.2019.9095822","title":"FORMI: A Fast Holonomic Path Planning and Obstacle Representation Method Based on Interval Analysis","display_name":"FORMI: A Fast Holonomic Path Planning and Obstacle Representation Method Based on Interval Analysis","publication_year":2019,"publication_date":"2019-11-01","ids":{"openalex":"https://openalex.org/W3026174244","doi":"https://doi.org/10.1109/cis-ram47153.2019.9095822","mag":"3026174244"},"language":"en","primary_location":{"id":"doi:10.1109/cis-ram47153.2019.9095822","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cis-ram47153.2019.9095822","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE International Conference on Cybernetics and Intelligent Systems (CIS) and IEEE Conference on Robotics, Automation and Mechatronics (RAM)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5080406291","display_name":"Pekka M\u00e4enp\u00e4\u00e4","orcid":null},"institutions":[{"id":"https://openalex.org/I166825849","display_name":"Tampere University","ror":"https://ror.org/033003e23","country_code":"FI","type":"education","lineage":["https://openalex.org/I166825849"]}],"countries":["FI"],"is_corresponding":true,"raw_author_name":"Pekka Maenpaa","raw_affiliation_strings":["Automation Technologies and Mechanical Engineering Unit, Tampere University Tampere, Finland"],"affiliations":[{"raw_affiliation_string":"Automation Technologies and Mechanical Engineering Unit, Tampere University Tampere, Finland","institution_ids":["https://openalex.org/I166825849"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025625789","display_name":"Mohammad M. Aref","orcid":"https://orcid.org/0000-0001-8326-8421"},"institutions":[{"id":"https://openalex.org/I166825849","display_name":"Tampere University","ror":"https://ror.org/033003e23","country_code":"FI","type":"education","lineage":["https://openalex.org/I166825849"]}],"countries":["FI"],"is_corresponding":false,"raw_author_name":"Mohammad M. Aref","raw_affiliation_strings":["Automation Technologies and Mechanical Engineering Unit, Tampere University Tampere, Finland"],"affiliations":[{"raw_affiliation_string":"Automation Technologies and Mechanical Engineering Unit, Tampere University Tampere, Finland","institution_ids":["https://openalex.org/I166825849"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5070792821","display_name":"Jouni Mattila","orcid":"https://orcid.org/0000-0003-1799-4323"},"institutions":[{"id":"https://openalex.org/I166825849","display_name":"Tampere University","ror":"https://ror.org/033003e23","country_code":"FI","type":"education","lineage":["https://openalex.org/I166825849"]}],"countries":["FI"],"is_corresponding":false,"raw_author_name":"Jouni Mattila","raw_affiliation_strings":["Automation Technologies and Mechanical Engineering Unit, Tampere University Tampere, Finland"],"affiliations":[{"raw_affiliation_string":"Automation Technologies and Mechanical Engineering Unit, Tampere University Tampere, Finland","institution_ids":["https://openalex.org/I166825849"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5080406291"],"corresponding_institution_ids":["https://openalex.org/I166825849"],"apc_list":null,"apc_paid":null,"fwci":0.1021,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.49422541,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"593598","issue":null,"first_page":"398","last_page":"403"},"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/T10142","display_name":"Formal Methods in Verification","score":0.9968000054359436,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T11099","display_name":"Autonomous Vehicle Technology and Safety","score":0.9922999739646912,"subfield":{"id":"https://openalex.org/subfields/2203","display_name":"Automotive 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/quadtree","display_name":"Quadtree","score":0.8910154700279236},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.7296237945556641},{"id":"https://openalex.org/keywords/occupancy-grid-mapping","display_name":"Occupancy grid mapping","score":0.713971734046936},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.6295373439788818},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5666431784629822},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5385211110115051},{"id":"https://openalex.org/keywords/mobile-robot","display_name":"Mobile robot","score":0.5187994837760925},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4599027633666992},{"id":"https://openalex.org/keywords/any-angle-path-planning","display_name":"Any-angle path planning","score":0.45307159423828125},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4507442116737366},{"id":"https://openalex.org/keywords/obstacle","display_name":"Obstacle","score":0.44077906012535095},{"id":"https://openalex.org/keywords/holonomic","display_name":"Holonomic","score":0.4365695118904114},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4101082682609558},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.357174813747406},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.30297744274139404},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.30215317010879517},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.22410434484481812},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.13630759716033936}],"concepts":[{"id":"https://openalex.org/C151416825","wikidata":"https://www.wikidata.org/wiki/Q934791","display_name":"Quadtree","level":2,"score":0.8910154700279236},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.7296237945556641},{"id":"https://openalex.org/C57077369","wikidata":"https://www.wikidata.org/wiki/Q7075747","display_name":"Occupancy grid mapping","level":4,"score":0.713971734046936},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.6295373439788818},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5666431784629822},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5385211110115051},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.5187994837760925},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4599027633666992},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.45307159423828125},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4507442116737366},{"id":"https://openalex.org/C2776650193","wikidata":"https://www.wikidata.org/wiki/Q264661","display_name":"Obstacle","level":2,"score":0.44077906012535095},{"id":"https://openalex.org/C2777964439","wikidata":"https://www.wikidata.org/wiki/Q5884201","display_name":"Holonomic","level":2,"score":0.4365695118904114},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4101082682609558},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.357174813747406},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.30297744274139404},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.30215317010879517},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.22410434484481812},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.13630759716033936},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/cis-ram47153.2019.9095822","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cis-ram47153.2019.9095822","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE International Conference on Cybernetics and Intelligent Systems (CIS) and IEEE Conference on Robotics, Automation and Mechatronics (RAM)","raw_type":"proceedings-article"},{"id":"pmh:oai:trepo.tuni.fi:10024/215881","is_oa":false,"landing_page_url":"https://trepo.tuni.fi/handle/10024/215881","pdf_url":null,"source":{"id":"https://openalex.org/S7407055260","display_name":"Trepo - Institutional Repository of Tampere University","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":null,"raw_type":"conference"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7599999904632568,"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W65745200","https://openalex.org/W131069610","https://openalex.org/W1424654272","https://openalex.org/W1605218591","https://openalex.org/W1611476298","https://openalex.org/W1926428750","https://openalex.org/W1968840993","https://openalex.org/W2099659316","https://openalex.org/W2118197096","https://openalex.org/W2148820580","https://openalex.org/W2151402824","https://openalex.org/W2416579588","https://openalex.org/W2587415290","https://openalex.org/W2588041659","https://openalex.org/W2883418145","https://openalex.org/W2909577451","https://openalex.org/W3003747652","https://openalex.org/W4241612360","https://openalex.org/W4250574232","https://openalex.org/W6605295560","https://openalex.org/W6636175460","https://openalex.org/W6682185011","https://openalex.org/W6682324061","https://openalex.org/W6716569571"],"related_works":["https://openalex.org/W2207790469","https://openalex.org/W4253586140","https://openalex.org/W2042588826","https://openalex.org/W2372141727","https://openalex.org/W2388177796","https://openalex.org/W2374683706","https://openalex.org/W2908094156","https://openalex.org/W2403683192","https://openalex.org/W2004837674","https://openalex.org/W3172527413"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"a":[3,16,26,75,80,88,108],"path":[4,27,62,73,141],"planning":[5,63],"approach":[6],"for":[7,71,83,148,156],"mobile":[8],"robots":[9],"in":[10,87,92,128],"2D":[11],"spaces.":[12,161],"The":[13,36,54,117,144,162],"algorithm":[14,37,56,82,119,145,164],"uses":[15,38],"quadtree":[17,45],"decomposition":[18,46],"where":[19],"the":[20,29,44,97,100,137],"discretization":[21],"precision":[22],"is":[23,31,57,106,146],"improved":[24],"until":[25],"to":[28,42,47,96,122,151],"goal":[30],"found":[32,121],"if":[33],"one":[34],"exists.":[35],"interval":[39],"analysis-based":[40],"methods":[41],"categorize":[43],"occupied,":[48],"free":[49],"and":[50,79,114,140,155],"partly":[51],"occupied":[52],"cells.":[53],"proposed":[55,118,163],"compared":[58],"against":[59],"other":[60,98],"concurrent":[61],"algorithms,":[64],"A*":[65,70],"on":[66,74,136,169],"an":[67],"ordinary":[68],"quadtree,":[69],"shortest":[72],"binary":[76],"occupancy":[77,90],"grid,":[78,91],"Dijkstra's":[81],"lowest":[84],"collision":[85,126],"probability":[86],"continuous-valued":[89],"five":[93],"different":[94],"scenarios.Compared":[95],"methods,":[99],"main":[101],"advantage":[102],"of":[103,159],"our":[104],"method":[105],"achieving":[107],"compromise":[109],"between":[110],"driving":[111],"distance,":[112],"safety,":[113],"computation":[115],"time.":[116],"was":[120],"require":[123],"significantly":[124],"fewer":[125],"checks":[127],"all":[129],"scenarios":[130],"while":[131],"providing":[132],"sub-optimum":[133],"results,":[134],"based":[135],"obstacle":[138],"distance":[139],"length":[142],"criteria.":[143],"suitable":[147],"further":[149],"extension":[150],"include":[152],"non-euclidean":[153],"measures":[154],"higher":[157],"dimensions":[158],"configuration":[160],"will":[165],"be":[166],"publicly":[167],"available":[168],"GitHub":[170],"repository.":[171]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2026-03-07T16:01:11.037858","created_date":"2025-10-10T00:00:00"}