{"id":"https://openalex.org/W2513969461","doi":"https://doi.org/10.1109/iscas.2016.7538930","title":"Multiobjective path planning on uneven terrains based on NAMOA","display_name":"Multiobjective path planning on uneven terrains based on NAMOA","publication_year":2016,"publication_date":"2016-05-01","ids":{"openalex":"https://openalex.org/W2513969461","doi":"https://doi.org/10.1109/iscas.2016.7538930","mag":"2513969461"},"language":"en","primary_location":{"id":"doi:10.1109/iscas.2016.7538930","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iscas.2016.7538930","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE International Symposium on Circuits and Systems (ISCAS)","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://ira.lib.polyu.edu.hk/bitstream/10397/54597/1/Ganganath_Multiobjective_Path_Planning.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5047360922","display_name":"Nuwan Ganganath","orcid":"https://orcid.org/0000-0002-7381-9493"},"institutions":[{"id":"https://openalex.org/I14243506","display_name":"Hong Kong Polytechnic University","ror":"https://ror.org/0030zas98","country_code":"HK","type":"education","lineage":["https://openalex.org/I14243506"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Nuwan Ganganath","raw_affiliation_strings":["Department of Electronic and Information Engineering, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electronic and Information Engineering, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong","institution_ids":["https://openalex.org/I14243506"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5049007224","display_name":"Chi\u2010Tsun Cheng","orcid":"https://orcid.org/0000-0003-3306-6148"},"institutions":[{"id":"https://openalex.org/I14243506","display_name":"Hong Kong Polytechnic University","ror":"https://ror.org/0030zas98","country_code":"HK","type":"education","lineage":["https://openalex.org/I14243506"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Chi-Tsun Cheng","raw_affiliation_strings":["Department of Electronic and Information Engineering, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electronic and Information Engineering, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong","institution_ids":["https://openalex.org/I14243506"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5021923917","display_name":"Chi K. Tse","orcid":"https://orcid.org/0000-0002-0462-3999"},"institutions":[{"id":"https://openalex.org/I14243506","display_name":"Hong Kong Polytechnic University","ror":"https://ror.org/0030zas98","country_code":"HK","type":"education","lineage":["https://openalex.org/I14243506"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Chi K. Tse","raw_affiliation_strings":["Department of Electronic and Information Engineering, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electronic and Information Engineering, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong","institution_ids":["https://openalex.org/I14243506"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I14243506"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":10,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1846","last_page":"1849"},"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/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.9869999885559082,"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"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9779000282287598,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/terrain","display_name":"Terrain","score":0.7934360504150391},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.7484219670295715},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7326674461364746},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.7038025856018066},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.6187685132026672},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6143964529037476},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6015480756759644},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5918720364570618},{"id":"https://openalex.org/keywords/planner","display_name":"Planner","score":0.5480069518089294},{"id":"https://openalex.org/keywords/energy","display_name":"Energy (signal processing)","score":0.5223466157913208},{"id":"https://openalex.org/keywords/mobile-robot","display_name":"Mobile robot","score":0.48950493335723877},{"id":"https://openalex.org/keywords/energy-consumption","display_name":"Energy consumption","score":0.4875349700450897},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.46441930532455444},{"id":"https://openalex.org/keywords/any-angle-path-planning","display_name":"Any-angle path planning","score":0.45981746912002563},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.40575316548347473},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.2916495203971863},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2023506760597229},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.15306821465492249},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1332135796546936},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.10105481743812561},{"id":"https://openalex.org/keywords/geography","display_name":"Geography","score":0.07703721523284912}],"concepts":[{"id":"https://openalex.org/C161840515","wikidata":"https://www.wikidata.org/wiki/Q186131","display_name":"Terrain","level":2,"score":0.7934360504150391},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.7484219670295715},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7326674461364746},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7038025856018066},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.6187685132026672},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6143964529037476},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6015480756759644},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5918720364570618},{"id":"https://openalex.org/C2776999362","wikidata":"https://www.wikidata.org/wiki/Q2349274","display_name":"Planner","level":2,"score":0.5480069518089294},{"id":"https://openalex.org/C186370098","wikidata":"https://www.wikidata.org/wiki/Q442787","display_name":"Energy (signal processing)","level":2,"score":0.5223466157913208},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.48950493335723877},{"id":"https://openalex.org/C2780165032","wikidata":"https://www.wikidata.org/wiki/Q16869822","display_name":"Energy consumption","level":2,"score":0.4875349700450897},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.46441930532455444},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.45981746912002563},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.40575316548347473},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.2916495203971863},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2023506760597229},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.15306821465492249},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1332135796546936},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.10105481743812561},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.07703721523284912},{"id":"https://openalex.org/C58640448","wikidata":"https://www.wikidata.org/wiki/Q42515","display_name":"Cartography","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C119599485","wikidata":"https://www.wikidata.org/wiki/Q43035","display_name":"Electrical engineering","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/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/iscas.2016.7538930","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iscas.2016.7538930","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE International Symposium on Circuits and Systems (ISCAS)","raw_type":"proceedings-article"},{"id":"pmh:oai:ira.lib.polyu.edu.hk:10397/54597","is_oa":true,"landing_page_url":"http://hdl.handle.net/10397/54597","pdf_url":"http://ira.lib.polyu.edu.hk/bitstream/10397/54597/1/Ganganath_Multiobjective_Path_Planning.pdf","source":{"id":"https://openalex.org/S4306400205","display_name":"PolyU Institutional Research Archive (Hong Kong Polytechnic University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I14243506","host_organization_name":"Hong Kong Polytechnic University","host_organization_lineage":["https://openalex.org/I14243506"],"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 Paper"}],"best_oa_location":{"id":"pmh:oai:ira.lib.polyu.edu.hk:10397/54597","is_oa":true,"landing_page_url":"http://hdl.handle.net/10397/54597","pdf_url":"http://ira.lib.polyu.edu.hk/bitstream/10397/54597/1/Ganganath_Multiobjective_Path_Planning.pdf","source":{"id":"https://openalex.org/S4306400205","display_name":"PolyU Institutional Research Archive (Hong Kong Polytechnic University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I14243506","host_organization_name":"Hong Kong Polytechnic University","host_organization_lineage":["https://openalex.org/I14243506"],"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 Paper"},"sustainable_development_goals":[{"display_name":"Affordable and clean energy","id":"https://metadata.un.org/sdg/7","score":0.8899999856948853}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2513969461.pdf","grobid_xml":"https://content.openalex.org/works/W2513969461.grobid-xml"},"referenced_works_count":10,"referenced_works":["https://openalex.org/W1480698831","https://openalex.org/W1637113018","https://openalex.org/W1895872128","https://openalex.org/W1969483458","https://openalex.org/W1970805560","https://openalex.org/W2043293052","https://openalex.org/W2050710547","https://openalex.org/W2109032771","https://openalex.org/W2169528473","https://openalex.org/W2548903497"],"related_works":["https://openalex.org/W2370345607","https://openalex.org/W2388051136","https://openalex.org/W2171039275","https://openalex.org/W2047399896","https://openalex.org/W191849398","https://openalex.org/W2767202586","https://openalex.org/W2369626564","https://openalex.org/W2523719706","https://openalex.org/W2198982833","https://openalex.org/W1990043277"],"abstract_inverted_index":{"Existing":[0],"path":[1,65,75,101,107],"planning":[2],"algorithms":[3],"are":[4,27],"capable":[5],"of":[6,74],"finding":[7],"physically":[8],"feasible,":[9],"shortest,":[10],"and":[11,45,54,77],"energy-efficient":[12],"paths":[13,23,33,56],"for":[14],"mobile":[15,50],"robots":[16],"navigating":[17],"on":[18,24,49,83],"uneven":[19,25],"terrains.":[20],"However,":[21],"shortest":[22,53],"terrains":[26],"often":[28],"energy":[29,46,78],"inefficient":[30],"while":[31],"energy-optimal":[32,55],"usually":[34],"take":[35],"long":[36],"time":[37,44],"to":[38,43],"be":[39,59,110],"traversed.":[40],"Therefore,":[41],"due":[42],"constraints":[47],"imposed":[48],"robots,":[51],"these":[52],"might":[57],"not":[58],"applicable.":[60],"We":[61],"propose":[62],"a":[63,89],"multiobjective":[64],"planner":[66,108],"that":[67,87,99],"can":[68,109],"find":[69],"pareto-optimal":[70],"solutions":[71],"in":[72,113],"terms":[73],"length":[76],"consumption.":[79],"It":[80],"is":[81],"based":[82],"NAMOA*":[84],"search":[85],"algorithm":[86],"utilizes":[88],"proposed":[90,106],"monotone":[91],"heuristic":[92],"cost":[93],"function.":[94],"The":[95],"simulation":[96],"results":[97],"show":[98],"nondominated":[100],"options":[102],"found":[103],"by":[104],"the":[105],"very":[111],"useful":[112],"many":[114],"real-world":[115],"applications.":[116]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}