{"id":"https://openalex.org/W4399769850","doi":"https://doi.org/10.1109/icara60736.2024.10553030","title":"Using Combined Knapsack and Shortest Path Problems for Planning Optimal Navigation Paths for Robotic Deliveries","display_name":"Using Combined Knapsack and Shortest Path Problems for Planning Optimal Navigation Paths for Robotic Deliveries","publication_year":2024,"publication_date":"2024-02-22","ids":{"openalex":"https://openalex.org/W4399769850","doi":"https://doi.org/10.1109/icara60736.2024.10553030"},"language":"en","primary_location":{"id":"doi:10.1109/icara60736.2024.10553030","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icara60736.2024.10553030","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 10th International Conference on Automation, Robotics and Applications (ICARA)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5048315686","display_name":"Nadav Voloch","orcid":"https://orcid.org/0000-0001-5296-4985"},"institutions":[{"id":"https://openalex.org/I2802112877","display_name":"Ruppin Academic Center","ror":"https://ror.org/0361c8163","country_code":"IL","type":"education","lineage":["https://openalex.org/I2802112877"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Nadav Voloch","raw_affiliation_strings":["Ruppin Academic Center,Computer Engineering department,Emek Hefer,Israel","Computer Engineering department, Ruppin Academic Center, Emek Hefer, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ruppin Academic Center,Computer Engineering department,Emek Hefer,Israel","institution_ids":["https://openalex.org/I2802112877"]},{"raw_affiliation_string":"Computer Engineering department, Ruppin Academic Center, Emek Hefer, Israel","institution_ids":["https://openalex.org/I2802112877"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5028247137","display_name":"Yair Zadok","orcid":null},"institutions":[{"id":"https://openalex.org/I72373871","display_name":"Achva Academic College","ror":"https://ror.org/024hcay96","country_code":"IL","type":"education","lineage":["https://openalex.org/I72373871"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Yair Zadok","raw_affiliation_strings":["Achva Academic College,Information Systems department,Shikmim,Israel","Information Systems department, Achva Academic College, Shikmim, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Achva Academic College,Information Systems department,Shikmim,Israel","institution_ids":["https://openalex.org/I72373871"]},{"raw_affiliation_string":"Information Systems department, Achva Academic College, Shikmim, Israel","institution_ids":["https://openalex.org/I72373871"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5055141922","display_name":"Noa Voloch\u2010Bloch","orcid":null},"institutions":[{"id":"https://openalex.org/I2802112877","display_name":"Ruppin Academic Center","ror":"https://ror.org/0361c8163","country_code":"IL","type":"education","lineage":["https://openalex.org/I2802112877"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Noa Voloch-Bloch","raw_affiliation_strings":["Ruppin Academic Center,Electrical Engineering department,Emek Hefer,Israel","Electrical Engineering department, Ruppin Academic Center, Emek Hefer, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ruppin Academic Center,Electrical Engineering department,Emek Hefer,Israel","institution_ids":["https://openalex.org/I2802112877"]},{"raw_affiliation_string":"Electrical Engineering department, Ruppin Academic Center, Emek Hefer, Israel","institution_ids":["https://openalex.org/I2802112877"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5033306328","display_name":"Maor Meir Hajaj","orcid":null},"institutions":[{"id":"https://openalex.org/I91203450","display_name":"University of Haifa","ror":"https://ror.org/02f009v59","country_code":"IL","type":"education","lineage":["https://openalex.org/I91203450"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Maor Meir Hajaj","raw_affiliation_strings":["University of Haifa,Information Systems department,Haifa,Israel","Information Systems department, University of Haifa, Haifa, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Haifa,Information Systems department,Haifa,Israel","institution_ids":["https://openalex.org/I91203450"]},{"raw_affiliation_string":"Information Systems department, University of Haifa, Haifa, Israel","institution_ids":["https://openalex.org/I91203450"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.0517,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.81287188,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":97,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"139","last_page":"143"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998999834060669,"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.9998999834060669,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9988999962806702,"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"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.998199999332428,"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/knapsack-problem","display_name":"Knapsack problem","score":0.8953837156295776},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.7815941572189331},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.7281336784362793},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6183043122291565},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5674507021903992},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.5353553295135498},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.445644736289978},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.44539690017700195},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.42395615577697754},{"id":"https://openalex.org/keywords/mobile-robot","display_name":"Mobile robot","score":0.4211209714412689},{"id":"https://openalex.org/keywords/operations-research","display_name":"Operations research","score":0.3275607228279114},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.29572486877441406},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2580036520957947},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.19230031967163086},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17624419927597046},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.11574029922485352},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.11482483148574829},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.08048668503761292}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.8953837156295776},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7815941572189331},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.7281336784362793},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6183043122291565},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5674507021903992},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.5353553295135498},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.445644736289978},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.44539690017700195},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.42395615577697754},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.4211209714412689},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.3275607228279114},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.29572486877441406},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2580036520957947},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.19230031967163086},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17624419927597046},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.11574029922485352},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.11482483148574829},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.08048668503761292}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icara60736.2024.10553030","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icara60736.2024.10553030","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 10th International Conference on Automation, Robotics and Applications (ICARA)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/7","display_name":"Affordable and clean energy","score":0.46000000834465027}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1546693390","https://openalex.org/W1964443412","https://openalex.org/W1966693694","https://openalex.org/W1971101765","https://openalex.org/W1982346568","https://openalex.org/W2041172083","https://openalex.org/W2060322444","https://openalex.org/W2090696439","https://openalex.org/W2149342630","https://openalex.org/W2169528473","https://openalex.org/W2562268519","https://openalex.org/W2562755098","https://openalex.org/W2765923746","https://openalex.org/W2768584571","https://openalex.org/W2776398026","https://openalex.org/W2955399703","https://openalex.org/W3093562775","https://openalex.org/W3166238888","https://openalex.org/W4200569228","https://openalex.org/W4213060883","https://openalex.org/W4232479183","https://openalex.org/W4285309024","https://openalex.org/W4312980200","https://openalex.org/W6746224849"],"related_works":["https://openalex.org/W2198982833","https://openalex.org/W2767202586","https://openalex.org/W2523719706","https://openalex.org/W1990043277","https://openalex.org/W2375775343","https://openalex.org/W4223969905","https://openalex.org/W2388654557","https://openalex.org/W2018146256","https://openalex.org/W2388051136","https://openalex.org/W4310124294"],"abstract_inverted_index":{"Today.,":[0],"the":[1,15,46,80,84,96,101,115,210],"use":[2],"of":[3,26,54,119,164,191,233,249],"robotic":[4],"navigational":[5],"tools":[6],"is":[7,19,149,169,208],"widely":[8,72],"used":[9],"both":[10,234],"in":[11,44,75,157],"academical":[12],"research":[13],"and":[14,32,66,83,105,117,141,188,218,253],"technological":[16],"industry.,":[17],"there":[18],"a":[20,41,107,129,162,175,178,231],"growing":[21],"need":[22,193],"for":[23,95,240],"planning":[24],"paths":[25,86],"navigation":[27],"to":[28,40,49,171,194],"autonomous":[29],"machines.,":[30],"robots":[31],"transportation":[33],"vehicles.":[34],"In":[35,124],"this":[36,111,158,201],"paper":[37],"we":[38,127,133,205],"relate":[39],"specific":[42],"problem":[43,82,98,104,131,204],"which":[45],"robot":[47],"has":[48,177],"navigate":[50],"between":[51,214],"several":[52,59],"points":[53],"delivery.,":[55],"every":[56],"point":[57],"contains":[58],"items":[60,147,192],"that":[61],"all":[62],"have":[63],"different":[64,67,130,198],"weights":[65],"values.":[68],"There":[69],"are":[70],"two":[71,146,215],"researched":[73],"problems":[74],"computer":[76],"science":[77],"algorithms.,":[78],"namely":[79],"knapsack":[81,97,108,165,228],"shortest":[85,102],"on":[87,152,221],"weighted":[88],"graphs":[89],"problem.":[90],"Typically.,":[91],"dynamic":[92],"programming":[93],"solutions":[94],"involve":[99],"using":[100],"path":[103,176,213],"creating":[106],"graph.":[109],"However.,":[110],"approach":[112],"only":[113],"considers":[114],"weight":[116,143],"value":[118],"each":[120],"item":[121,137,139],"or":[122,185,230],"vertex.":[123],"our":[125],"case.,":[126],"introduce":[128],"where":[132,174],"consider":[134],"three":[135,222],"properties:":[136],"weight.,":[138,226],"value.,":[140,229],"edge":[142,225],"(which":[144],"connects":[145],"but":[148],"not":[150],"dependent":[151],"its":[153,250],"vertices).":[154],"Each":[155],"vertex":[156],"particular":[159],"graph":[160],"represents":[161],"set":[163],"items.":[166],"This":[167],"scenario":[168],"applicable":[170],"real-life":[172],"situations":[173],"non-dependent":[179],"attribute":[180],"(such":[181],"as":[182],"physical":[183],"distance":[184],"travel":[186],"time)":[187],"various":[189],"types":[190],"be":[195],"selected":[196],"at":[197],"locations":[199],"along":[200,245],"path.":[202],"The":[203],"address":[206],"here":[207],"finding":[209,241],"most":[211],"efficient":[212],"vertices":[216],"(source":[217],"target)":[219],"based":[220],"aspects:":[223],"minimal":[224],"maximum":[227],"combination":[232],"properties.":[235],"We":[236],"present":[237],"an":[238],"algorithm":[239],"these":[242],"optimal":[243],"paths.,":[244],"with":[246],"detailed":[247],"explanations":[248],"decision-making":[251],"process":[252],"implementation.":[254]},"counts_by_year":[{"year":2025,"cited_by_count":4}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}