{"id":"https://openalex.org/W2904689127","doi":"https://doi.org/10.1109/itsc.2018.8569712","title":"Context-Aware Route Planning for Automated Warehouses","display_name":"Context-Aware Route Planning for Automated Warehouses","publication_year":2018,"publication_date":"2018-11-01","ids":{"openalex":"https://openalex.org/W2904689127","doi":"https://doi.org/10.1109/itsc.2018.8569712","mag":"2904689127"},"language":"en","primary_location":{"id":"doi:10.1109/itsc.2018.8569712","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itsc.2018.8569712","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 21st International Conference on Intelligent Transportation Systems (ITSC)","raw_type":"proceedings-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1901.07422","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Jakub Hvezda","orcid":null},"institutions":[{"id":"https://openalex.org/I44504214","display_name":"Czech Technical University in Prague","ror":"https://ror.org/03kqpb082","country_code":"CZ","type":"education","lineage":["https://openalex.org/I44504214"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Jakub Hvezda","raw_affiliation_strings":["Department of Cybernetics Faculty of Electrical Engineering, Czech Technical University, Prague Prague, Czech Republic"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Cybernetics Faculty of Electrical Engineering, Czech Technical University, Prague Prague, Czech Republic","institution_ids":["https://openalex.org/I44504214"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Tomas Rybecky","orcid":null},"institutions":[{"id":"https://openalex.org/I44504214","display_name":"Czech Technical University in Prague","ror":"https://ror.org/03kqpb082","country_code":"CZ","type":"education","lineage":["https://openalex.org/I44504214"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Tomas Rybecky","raw_affiliation_strings":["Department of Cybernetics Faculty of Electrical Engineering, Czech Technical University, Prague Prague, Czech Republic"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Cybernetics Faculty of Electrical Engineering, Czech Technical University, Prague Prague, Czech Republic","institution_ids":["https://openalex.org/I44504214"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Miroslav Kulich","orcid":null},"institutions":[{"id":"https://openalex.org/I44504214","display_name":"Czech Technical University in Prague","ror":"https://ror.org/03kqpb082","country_code":"CZ","type":"education","lineage":["https://openalex.org/I44504214"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Miroslav Kulich","raw_affiliation_strings":["Czech Institute of Informatics, Robotics, and Cybernetics Czech Technical University, Prague Prague, Czech Republic"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Czech Institute of Informatics, Robotics, and Cybernetics Czech Technical University, Prague Prague, Czech Republic","institution_ids":["https://openalex.org/I44504214"]}]},{"author_position":"last","author":{"id":null,"display_name":"Libor Preucil","orcid":null},"institutions":[{"id":"https://openalex.org/I44504214","display_name":"Czech Technical University in Prague","ror":"https://ror.org/03kqpb082","country_code":"CZ","type":"education","lineage":["https://openalex.org/I44504214"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Libor Preucil","raw_affiliation_strings":["Czech Institute of Informatics, Robotics, and Cybernetics Czech Technical University, Prague Prague, Czech Republic"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Czech Institute of Informatics, Robotics, and Cybernetics Czech Technical University, Prague Prague, Czech Republic","institution_ids":["https://openalex.org/I44504214"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.424,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.68874231,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"2955","last_page":"2960"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9997000098228455,"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.9997000098228455,"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/T12288","display_name":"Optimization and Search Problems","score":0.9970999956130981,"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"}},{"id":"https://openalex.org/T12784","display_name":"Modular Robots and Swarm Intelligence","score":0.9965000152587891,"subfield":{"id":"https://openalex.org/subfields/2210","display_name":"Mechanical 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/robot","display_name":"Robot","score":0.7657999992370605},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.7172999978065491},{"id":"https://openalex.org/keywords/plan","display_name":"Plan (archaeology)","score":0.6534000039100647},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.511900007724762},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.5091999769210815},{"id":"https://openalex.org/keywords/quality","display_name":"Quality (philosophy)","score":0.4652999937534332},{"id":"https://openalex.org/keywords/route-planning","display_name":"Route planning","score":0.4652999937534332},{"id":"https://openalex.org/keywords/trajectory","display_name":"Trajectory","score":0.44369998574256897}],"concepts":[{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.7657999992370605},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.7172999978065491},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6962000131607056},{"id":"https://openalex.org/C2776505523","wikidata":"https://www.wikidata.org/wiki/Q4785468","display_name":"Plan (archaeology)","level":2,"score":0.6534000039100647},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.511900007724762},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.5091999769210815},{"id":"https://openalex.org/C2779530757","wikidata":"https://www.wikidata.org/wiki/Q1207505","display_name":"Quality (philosophy)","level":2,"score":0.4652999937534332},{"id":"https://openalex.org/C2989549987","wikidata":"https://www.wikidata.org/wiki/Q350882","display_name":"Route planning","level":2,"score":0.4652999937534332},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.44369998574256897},{"id":"https://openalex.org/C157764524","wikidata":"https://www.wikidata.org/wiki/Q1383412","display_name":"Throughput","level":3,"score":0.429500013589859},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.40849998593330383},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.40059998631477356},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.3630000054836273},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.35589998960494995},{"id":"https://openalex.org/C2779454638","wikidata":"https://www.wikidata.org/wiki/Q7100700","display_name":"Order picking","level":3,"score":0.3425000011920929},{"id":"https://openalex.org/C18465707","wikidata":"https://www.wikidata.org/wiki/Q5001797","display_name":"Business system planning","level":2,"score":0.3098999857902527},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.30379998683929443},{"id":"https://openalex.org/C13736549","wikidata":"https://www.wikidata.org/wiki/Q4489420","display_name":"Industrial engineering","level":1,"score":0.2883000075817108},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.28780001401901245},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.2797999978065491},{"id":"https://openalex.org/C2985733770","wikidata":"https://www.wikidata.org/wiki/Q1233007","display_name":"Travel time","level":2,"score":0.2775000035762787},{"id":"https://openalex.org/C44154836","wikidata":"https://www.wikidata.org/wiki/Q45045","display_name":"Simulation","level":1,"score":0.27250000834465027},{"id":"https://openalex.org/C19012869","wikidata":"https://www.wikidata.org/wiki/Q578372","display_name":"Response time","level":2,"score":0.2540000081062317},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2533000111579895},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.2517000138759613}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/itsc.2018.8569712","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itsc.2018.8569712","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 21st International Conference on Intelligent Transportation Systems (ITSC)","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:1901.07422","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1901.07422","pdf_url":"https://arxiv.org/pdf/1901.07422","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"text"},{"id":"pmh:oai:zenodo.org:3953608","is_oa":true,"landing_page_url":"https://doi.org/10.1109/ITSC.2018.8569712","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/conferencePaper"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1901.07422","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1901.07422","pdf_url":"https://arxiv.org/pdf/1901.07422","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1559302327","https://openalex.org/W1614580925","https://openalex.org/W1999528952","https://openalex.org/W2007193228","https://openalex.org/W2011282943","https://openalex.org/W2061085501","https://openalex.org/W2072839015","https://openalex.org/W2128303554","https://openalex.org/W2135939055","https://openalex.org/W2147526018","https://openalex.org/W2155313135","https://openalex.org/W2169742265","https://openalex.org/W4242811155","https://openalex.org/W4300449797","https://openalex.org/W6605295560","https://openalex.org/W6608015362"],"related_works":[],"abstract_inverted_index":{"In":[0],"order":[1],"to":[2,13,32,49,76,80,133,163],"ensure":[3],"efficient":[4],"flow":[5],"of":[6,57,64,74,91,116,121,153,193],"goods":[7,28,77],"in":[8,21,45,70,109,127],"an":[9,22,72],"automated":[10,117],"warehouse":[11],"and":[12,40,44,88,100,190],"guarantee":[14],"its":[15],"continuous":[16],"distribution":[17],"to/from":[18],"picking":[19,35],"stations":[20],"effective":[23],"way,":[24],"decisions":[25],"about":[26],"which":[27,33,38,42,46,71,166,207],"will":[29],"be":[30,50],"delivered":[31],"particular":[34,84,95],"station":[36],"by":[37,41,138,203],"robot":[39,155],"path":[43],"time":[47,85],"have":[48,79],"made":[51],"based":[52,168],"on":[53,169],"the":[54,58,134,151,170,182,197],"current":[55],"state":[56],"warehouse.":[59],"This":[60,200],"task":[61,68],"involves":[62],"solution":[63],"two":[65],"suproblems:":[66],"(1)":[67],"allocation":[69],"assignment":[73],"robots":[75,96,123],"they":[78,129],"deliver":[81],"at":[82],"a":[83,145,148,160,186],"is":[86,107,167,201,208],"found":[87],"(2)":[89],"planning":[90,105,173],"collision-free":[92],"trajectories":[93],"for":[94,212],"(given":[97],"their":[98],"actual":[99],"goal":[101],"positions).":[102],"The":[103,176],"trajectory":[104],"problem":[106,165],"addressed":[108],"this":[110,164],"paper":[111],"taking":[112],"into":[113],"account":[114],"specifics":[115],"warehouses.":[118],"First,":[119],"assignments":[120],"all":[122],"are":[124,130],"not":[125,143],"known":[126],"advance,":[128],"instead":[131],"presented":[132],"algorithm":[135,174],"gradually":[136],"one":[137],"one.":[139],"Moreover,":[140],"we":[141],"do":[142],"optimize":[144],"makespan,":[146],"but":[147],"throughput":[149],"-":[150],"sum":[152],"individual":[154],"plan":[156],"costs.":[157],"We":[158],"introduce":[159],"novel":[161],"approach":[162,184],"context-aware":[171],"route":[172],"[1].":[175],"performed":[177],"experimental":[178],"results":[179,192],"show":[180],"that":[181],"proposed":[183],"has":[185],"lower":[187],"fail":[188],"rate":[189],"produces":[191],"higher":[194,204],"quality":[195],"than":[196],"original":[198],"algorithm.":[199],"redeemed":[202],"computational":[205],"complexity":[206],"nevertheless":[209],"low":[210],"enough":[211],"real-time":[213],"planning.":[214]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2018-12-22T00:00:00"}