{"id":"https://openalex.org/W4396648475","doi":"https://doi.org/10.1145/3653081.3653163","title":"Analysis and Design of Multiple Constraint Indexes in Path Planning","display_name":"Analysis and Design of Multiple Constraint Indexes in Path Planning","publication_year":2023,"publication_date":"2023-11-24","ids":{"openalex":"https://openalex.org/W4396648475","doi":"https://doi.org/10.1145/3653081.3653163"},"language":"en","primary_location":{"id":"doi:10.1145/3653081.3653163","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3653081.3653163","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2023 5th International Conference on Internet of Things, Automation and Artificial Intelligence","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/A5069919353","display_name":"Renjie Li","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Renjie Li","raw_affiliation_strings":["China Institute of Marine Technology &amp; Economy, China"],"affiliations":[{"raw_affiliation_string":"China Institute of Marine Technology &amp; Economy, China","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5081424552","display_name":"Xin Peng","orcid":"https://orcid.org/0009-0003-3796-2182"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Xin Peng","raw_affiliation_strings":["China Institute of Marine Technology &amp; Economy, China"],"affiliations":[{"raw_affiliation_string":"China Institute of Marine Technology &amp; Economy, China","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5069919353"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.22328257,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"492","last_page":"497"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9947999715805054,"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":0.9947999715805054,"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/T11622","display_name":"Maritime Navigation and Safety","score":0.9939000010490417,"subfield":{"id":"https://openalex.org/subfields/2212","display_name":"Ocean 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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9790999889373779,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/cruise","display_name":"Cruise","score":0.8518786430358887},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.6853134632110596},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.6286752820014954},{"id":"https://openalex.org/keywords/analytic-hierarchy-process","display_name":"Analytic hierarchy process","score":0.5908059477806091},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5653383135795593},{"id":"https://openalex.org/keywords/cruise-missile","display_name":"Cruise missile","score":0.5652605295181274},{"id":"https://openalex.org/keywords/operations-research","display_name":"Operations research","score":0.5117428302764893},{"id":"https://openalex.org/keywords/crew","display_name":"Crew","score":0.48537957668304443},{"id":"https://openalex.org/keywords/transport-engineering","display_name":"Transport engineering","score":0.47094735503196716},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4505414068698883},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4121454060077667},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.22158744931221008}],"concepts":[{"id":"https://openalex.org/C2778821358","wikidata":"https://www.wikidata.org/wiki/Q2063640","display_name":"Cruise","level":2,"score":0.8518786430358887},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.6853134632110596},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.6286752820014954},{"id":"https://openalex.org/C87345402","wikidata":"https://www.wikidata.org/wiki/Q485202","display_name":"Analytic hierarchy process","level":2,"score":0.5908059477806091},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5653383135795593},{"id":"https://openalex.org/C28849524","wikidata":"https://www.wikidata.org/wiki/Q181860","display_name":"Cruise missile","level":3,"score":0.5652605295181274},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.5117428302764893},{"id":"https://openalex.org/C2780179797","wikidata":"https://www.wikidata.org/wiki/Q345844","display_name":"Crew","level":2,"score":0.48537957668304443},{"id":"https://openalex.org/C22212356","wikidata":"https://www.wikidata.org/wiki/Q775325","display_name":"Transport engineering","level":1,"score":0.47094735503196716},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4505414068698883},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4121454060077667},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.22158744931221008},{"id":"https://openalex.org/C178802073","wikidata":"https://www.wikidata.org/wiki/Q8421","display_name":"Aeronautics","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/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.0},{"id":"https://openalex.org/C2778857364","wikidata":"https://www.wikidata.org/wiki/Q974850","display_name":"Missile","level":2,"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/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3653081.3653163","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3653081.3653163","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2023 5th International Conference on Internet of Things, Automation and Artificial Intelligence","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":1,"referenced_works":["https://openalex.org/W3113254760"],"related_works":["https://openalex.org/W2061042597","https://openalex.org/W2390763667","https://openalex.org/W3209137076","https://openalex.org/W2374560440","https://openalex.org/W1490490684","https://openalex.org/W4221129498","https://openalex.org/W2887026015","https://openalex.org/W2361442013","https://openalex.org/W2373384475","https://openalex.org/W4310124294"],"abstract_inverted_index":{"Aiming":[0],"at":[1],"the":[2,6,17,33,44,52,64,73,79,99,103,107,133,137,150,156,174,181,186],"complex":[3],"constraints":[4,65],"in":[5],"path":[7,176],"planning":[8,68],"problem":[9],"on":[10,29,43,69,98,106],"cruise":[11,30,70,108],"ships,":[12,31],"this":[13,61,110],"paper,":[14],"after":[15],"considering":[16],"needs":[18,53],"of":[19,22,41,54,57,66,76,81,87,93,102,116,126,136,142,152,159,185],"various":[20,39],"groups":[21,40,56,86],"people":[23,42],"such":[24],"as":[25],"tourists":[26],"and":[27,72,144,180,183],"crew":[28],"extracts":[32],"attributes":[34,49],"that":[35,50],"are":[36,190],"required":[37],"by":[38,132,165],"road.":[45],"It.":[46],"proposes":[47],"passenger":[48],"reflect":[51],"different":[55,178],"people.":[58],"In":[59],"addition,":[60],"paper":[62,111],"explores":[63],"route":[67],"ships":[71],"travel":[74],"goals":[75],"passengers,":[77],"including":[78],"availability":[80],"road":[82,104,117,161],"sections":[83],"for":[84,173],"certain":[85],"people,":[88],"congestion":[89,143],"problems,":[90],"potential":[91],"preferences":[92],"tourists,":[94],"safety,":[95],"etc.":[96],"Based":[97],"data":[100],"model":[101],"section":[105,162],"ship,":[109],"establishes":[112],"a":[113],"hierarchical":[114],"structure":[115],"weights":[118],"with":[119],"multiple":[120],"dimensionless":[121],"attributes.":[122],"The":[123,139],"relative":[124,140],"importance":[125,134,141],"each":[127,160],"preference":[128],"requirement":[129],"is":[130,146,163,169],"determined":[131,147],"ranking":[135],"input.":[138],"safety":[145],"according":[148],"to":[149,171],"type":[151],"input":[153],"personnel.":[154],"Finally,":[155],"weight":[157],"value":[158],"obtained":[164],"AHP.":[166],"Dijkstra's":[167],"algorithm":[168],"used":[170],"search":[172],"optimal":[175],"under":[177],"constraints,":[179],"rationality":[182],"effectiveness":[184],"multi-constraint":[187],"index":[188],"design":[189],"verified.":[191]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
