{"id":"https://openalex.org/W2589931439","doi":"https://doi.org/10.1109/cig.2016.7860417","title":"Pruning and preprocessing methods for inventory-aware pathfinding","display_name":"Pruning and preprocessing methods for inventory-aware pathfinding","publication_year":2016,"publication_date":"2016-09-01","ids":{"openalex":"https://openalex.org/W2589931439","doi":"https://doi.org/10.1109/cig.2016.7860417","mag":"2589931439"},"language":"en","primary_location":{"id":"doi:10.1109/cig.2016.7860417","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cig.2016.7860417","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE Conference on Computational Intelligence and Games (CIG)","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://figshare.com/articles/conference_contribution/Pruning_and_preprocessing_methods_for_inventory-aware_pathfinding/27587778","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5089068488","display_name":"Davide Aversa","orcid":null},"institutions":[{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Davide Aversa","raw_affiliation_strings":["Department of Computer, Control, and Management Engineering, Sapienza University of Rome, Rome, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer, Control, and Management Engineering, Sapienza University of Rome, Rome, Italy","institution_ids":["https://openalex.org/I861853513"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5045872670","display_name":"Sebastian Sardi\u00f1a","orcid":"https://orcid.org/0000-0003-2962-0118"},"institutions":[{"id":"https://openalex.org/I82951845","display_name":"RMIT University","ror":"https://ror.org/04ttjf776","country_code":"AU","type":"education","lineage":["https://openalex.org/I82951845"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Sebastian Sardina","raw_affiliation_strings":["School of Computer Science and Information Technology, RMIT University, Melbourne, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science and Information Technology, RMIT University, Melbourne, Australia","institution_ids":["https://openalex.org/I82951845"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5084667235","display_name":"Stavros Vassos","orcid":"https://orcid.org/0000-0001-7564-5290"},"institutions":[{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Stavros Vassos","raw_affiliation_strings":["Department of Computer, Control, and Management Engineering, Sapienza University of Rome, Rome, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer, Control, and Management Engineering, Sapienza University of Rome, Rome, Italy","institution_ids":["https://openalex.org/I861853513"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.1006,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.46682817,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"8"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9969000220298767,"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.9969000220298767,"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/T10906","display_name":"AI-based Problem Solving and Planning","score":0.9955000281333923,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.9843999743461609,"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/pathfinding","display_name":"Pathfinding","score":0.8672327995300293},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8057650327682495},{"id":"https://openalex.org/keywords/pruning","display_name":"Pruning","score":0.7575050592422485},{"id":"https://openalex.org/keywords/preprocessor","display_name":"Preprocessor","score":0.7462202906608582},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.7054846882820129},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.4655965268611908},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.4154196083545685},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.3821074366569519},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.3539034426212311},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2193969488143921},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.10620126128196716},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.08202695846557617},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.07809773087501526}],"concepts":[{"id":"https://openalex.org/C25321074","wikidata":"https://www.wikidata.org/wiki/Q1969601","display_name":"Pathfinding","level":4,"score":0.8672327995300293},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8057650327682495},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.7575050592422485},{"id":"https://openalex.org/C34736171","wikidata":"https://www.wikidata.org/wiki/Q918333","display_name":"Preprocessor","level":2,"score":0.7462202906608582},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.7054846882820129},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.4655965268611908},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.4154196083545685},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.3821074366569519},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.3539034426212311},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2193969488143921},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.10620126128196716},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.08202695846557617},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.07809773087501526},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"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/C6557445","wikidata":"https://www.wikidata.org/wiki/Q173113","display_name":"Agronomy","level":1,"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":4,"locations":[{"id":"doi:10.1109/cig.2016.7860417","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cig.2016.7860417","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE Conference on Computational Intelligence and Games (CIG)","raw_type":"proceedings-article"},{"id":"pmh:oai:alma61RMIT.INST:11279054030001341","is_oa":false,"landing_page_url":"https://doi.org/10.1109/CIG.2016.7860417","pdf_url":null,"source":{"id":"https://openalex.org/S4306402074","display_name":"RMIT Research Repository (RMIT University Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I82951845","host_organization_name":"RMIT University","host_organization_lineage":["https://openalex.org/I82951845"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},{"id":"pmh:oai:figshare.com:article/27587778","is_oa":true,"landing_page_url":"https://figshare.com/articles/conference_contribution/Pruning_and_preprocessing_methods_for_inventory-aware_pathfinding/27587778","pdf_url":null,"source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"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 contribution"},{"id":"pmh:oai:iris.uniroma1.it:11573/933494","is_oa":false,"landing_page_url":"http://hdl.handle.net/11573/933494","pdf_url":null,"source":{"id":"https://openalex.org/S4377196107","display_name":"IRIS Research product catalog (Sapienza University of Rome)","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":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":{"id":"pmh:oai:figshare.com:article/27587778","is_oa":true,"landing_page_url":"https://figshare.com/articles/conference_contribution/Pruning_and_preprocessing_methods_for_inventory-aware_pathfinding/27587778","pdf_url":null,"source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"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 contribution"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W171621013","https://openalex.org/W176275507","https://openalex.org/W1910303475","https://openalex.org/W1993297915","https://openalex.org/W2021061679","https://openalex.org/W2111107602","https://openalex.org/W2135125135","https://openalex.org/W2151957548","https://openalex.org/W2165946530","https://openalex.org/W2224849162","https://openalex.org/W2337392266","https://openalex.org/W2401484145","https://openalex.org/W2462160226","https://openalex.org/W2963132092","https://openalex.org/W3022683862","https://openalex.org/W3215645495","https://openalex.org/W6606995618","https://openalex.org/W6639959095","https://openalex.org/W6676527066","https://openalex.org/W6689054827","https://openalex.org/W6713010797","https://openalex.org/W6718757514","https://openalex.org/W6776694869"],"related_works":["https://openalex.org/W4285687848","https://openalex.org/W4289994039","https://openalex.org/W2240526870","https://openalex.org/W3100156731","https://openalex.org/W2623016776","https://openalex.org/W1967962134","https://openalex.org/W3128311703","https://openalex.org/W3101047024","https://openalex.org/W131718761","https://openalex.org/W2295196644"],"abstract_inverted_index":{"Inventory-Aware":[0],"Pathfinding":[1],"is":[2],"concerned":[3],"with":[4],"finding":[5],"paths":[6],"while":[7],"taking":[8],"into":[9],"account":[10],"that":[11,39,65,96],"picking":[12],"up":[13,81],"items,":[14,82,103],"e.g.,":[15,24,104],"keys,":[16,105],"allow":[17],"the":[18,43,53,72,115,124,130],"character":[19],"to":[20,52,67,79,98],"unlock":[21],"blocked":[22],"pathways,":[23],"locked":[25],"doors.":[26],"In":[27],"this":[28],"work":[29],"we":[30,62,91],"present":[31],"a":[32,36,84,93],"pruning":[33,110,125],"method":[34,38],"and":[35,88,126],"preprocessing":[37,94,127],"can":[40],"improve":[41],"significantly":[42],"scalability":[44],"of":[45,56,71,123],"such":[46],"approaches.":[47],"We":[48,118],"apply":[49],"our":[50],"methods":[51,128],"recent":[54],"approach":[55],"Inventory-Driven":[57],"Jump-Point":[58],"Search":[59],"(InvJPS).":[60],"First,":[61],"introduce":[63],"InvJPS+":[64],"allows":[66,97],"prune":[68],"large":[69],"parts":[70],"search":[73,116],"space":[74],"by":[75],"favoring":[76],"short":[77],"detours":[78],"pick":[80],"offering":[83],"trade-off":[85],"between":[86],"efficiency":[87],"optimality.":[89],"Second,":[90],"propose":[92],"step":[95],"decide":[99],"on":[100],"runtime":[101],"which":[102],"are":[106],"worth":[107],"using":[108],"thus":[109],"potentially":[111],"unnecessary":[112],"items":[113],"before":[114],"starts.":[117],"show":[119],"results":[120],"for":[121],"combinations":[122],"illustrating":[129],"best":[131],"choices":[132],"over":[133],"various":[134],"scenarios.":[135]},"counts_by_year":[{"year":2017,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}