{"id":"https://openalex.org/W7164417431","doi":"https://doi.org/10.1109/ismvl68998.2026.00010","title":"An Efficient Heuristic Approach for Ion Shuttle Scheduling via Multi-Agent Path Planning","display_name":"An Efficient Heuristic Approach for Ion Shuttle Scheduling via Multi-Agent Path Planning","publication_year":2026,"publication_date":"2026-05-19","ids":{"openalex":"https://openalex.org/W7164417431","doi":"https://doi.org/10.1109/ismvl68998.2026.00010"},"language":null,"primary_location":{"id":"doi:10.1109/ismvl68998.2026.00010","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ismvl68998.2026.00010","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2026 IEEE 56th International Symposium on Multiple-Valued Logic (ISMVL)","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/A5138475706","display_name":"Jion Tamamoto","orcid":null},"institutions":[{"id":"https://openalex.org/I135768898","display_name":"Ritsumeikan University","ror":"https://ror.org/0197nmd03","country_code":"JP","type":"education","lineage":["https://openalex.org/I135768898","https://openalex.org/I4390039241"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Jion Tamamoto","raw_affiliation_strings":["Ritsumeikan University,Graduate School of Information Science and Engineering,Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ritsumeikan University,Graduate School of Information Science and Engineering,Japan","institution_ids":["https://openalex.org/I135768898"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5138429634","display_name":"Yuto Matuda","orcid":null},"institutions":[{"id":"https://openalex.org/I135768898","display_name":"Ritsumeikan University","ror":"https://ror.org/0197nmd03","country_code":"JP","type":"education","lineage":["https://openalex.org/I135768898","https://openalex.org/I4390039241"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Yuto Matuda","raw_affiliation_strings":["Ritsumeikan University,Graduate School of Information Science and Engineering,Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ritsumeikan University,Graduate School of Information Science and Engineering,Japan","institution_ids":["https://openalex.org/I135768898"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5114129909","display_name":"Daniel Schoenberger","orcid":null},"institutions":[{"id":"https://openalex.org/I62916508","display_name":"Technical University of Munich","ror":"https://ror.org/02kkvpp62","country_code":"DE","type":"education","lineage":["https://openalex.org/I62916508"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Daniel Schoenberger","raw_affiliation_strings":["Technical University of Munich,Chair for Design Automation,Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technical University of Munich,Chair for Design Automation,Germany","institution_ids":["https://openalex.org/I62916508"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5068612356","display_name":"Shigeru Yamashita","orcid":"https://orcid.org/0000-0002-2279-4644"},"institutions":[{"id":"https://openalex.org/I135768898","display_name":"Ritsumeikan University","ror":"https://ror.org/0197nmd03","country_code":"JP","type":"education","lineage":["https://openalex.org/I135768898","https://openalex.org/I4390039241"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Shigeru Yamashita","raw_affiliation_strings":["Ritsumeikan University,Graduate School of Information Science and Engineering,Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ritsumeikan University,Graduate School of Information Science and Engineering,Japan","institution_ids":["https://openalex.org/I135768898"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5138434231","display_name":"Robert Wille","orcid":null},"institutions":[{"id":"https://openalex.org/I62916508","display_name":"Technical University of Munich","ror":"https://ror.org/02kkvpp62","country_code":"DE","type":"education","lineage":["https://openalex.org/I62916508"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Robert Wille","raw_affiliation_strings":["Technical University of Munich,Chair for Design Automation,Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technical University of Munich,Chair for Design Automation,Germany","institution_ids":["https://openalex.org/I62916508"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.72372302,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"7","last_page":"12"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.37619999051094055,"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.37619999051094055,"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/T11082","display_name":"Spacecraft Dynamics and Control","score":0.062300000339746475,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.03849999979138374,"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/scheduling","display_name":"Scheduling (production processes)","score":0.545199990272522},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.45660001039505005},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.3822000026702881},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.3734999895095825},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.3666999936103821}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5911999940872192},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.545199990272522},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4603999853134155},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.45660001039505005},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.3822000026702881},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.3734999895095825},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.3666999936103821},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.35030001401901245},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2840999960899353},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.2721000015735626},{"id":"https://openalex.org/C114073186","wikidata":"https://www.wikidata.org/wiki/Q2631895","display_name":"Automated planning and scheduling","level":2,"score":0.2639000117778778}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ismvl68998.2026.00010","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ismvl68998.2026.00010","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2026 IEEE 56th International Symposium on Multiple-Valued Logic (ISMVL)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1530976094","https://openalex.org/W1978552568","https://openalex.org/W2067763535","https://openalex.org/W2074117827","https://openalex.org/W2169738367","https://openalex.org/W2415710521","https://openalex.org/W2473172692","https://openalex.org/W3043784418","https://openalex.org/W4292387678","https://openalex.org/W4384934446","https://openalex.org/W4388500029","https://openalex.org/W4388500208","https://openalex.org/W4393146733","https://openalex.org/W4405179822"],"related_works":[],"abstract_inverted_index":{"Trapped-ion":[0],"quantum":[1,13,35,50,71],"computers":[2,36],"are":[3],"gaining":[4],"attention":[5],"as":[6,28,63],"a":[7,29,38,135],"promising":[8],"platform":[9],"for":[10,32,115,119,126,165,168,172],"achieving":[11],"reliable":[12],"computation":[14],"using":[15,81],"high-quality":[16],"qubits.":[17],"Among":[18],"them,":[19],"the":[20,45,53,97,104,144,152,162],"Quantum":[21,120],"Charge-Coupled":[22],"Device":[23],"(QCCD)":[24],"architecture":[25],"is":[26],"recognized":[27],"modular":[30],"solution":[31],"constructing":[33],"scalable":[34],"with":[37],"large":[39],"number":[40],"of":[41,47,106,158],"qubits,":[42],"significantly":[43],"enhancing":[44],"feasibility":[46],"executing":[48],"practical":[49],"algorithms.":[51],"In":[52,139],"QCCD":[54],"architecture,":[55],"ions":[56],"shuttle":[57],"between":[58],"different":[59],"dedicated":[60],"zones,":[61,68],"such":[62],"memory":[64],"zones":[65],"and":[66,124,170],"processing":[67],"enabling":[69],"efficient":[70,78,89],"computation.In":[72],"this":[73],"paper,":[74],"we":[75],"propose":[76],"an":[77,88],"heuristic":[79],"approach":[80],"Multi-Agent":[82],"Path":[83],"Planning":[84],"(MAPP)":[85],"to":[86,112,134],"generate":[87],"shuttling":[90,151],"schedule":[91],"that":[92,103],"optimizes":[93],"ion":[94],"movement":[95],"within":[96],"device.":[98],"The":[99],"evaluation":[100],"results":[101],"show":[102],"numbers":[105],"time":[107,146],"steps":[108,147],"can":[109],"be":[110],"improved":[111],"only":[113,143,156],"88.61%":[114],"Full-Resister-Access":[116],"(FRA),":[117],"91.46%":[118],"Fourier":[121],"Transform":[122],"(QFT)":[123],"88.87%":[125],"Random":[127],"Register":[128],"Access":[129],"(RRA)":[130],"on":[131,150,174],"average":[132],"compared":[133],"state-of-the":[136],"art":[137],"method.":[138],"particular,":[140],"when":[141],"comparing":[142],"additional":[145],"spent":[148],"solely":[149],"proposed":[153],"algorithm":[154],"requires":[155],"76.83%":[157],"those":[159],"required":[160],"by":[161],"existing":[163],"method":[164],"FRA,":[166],"35.26%":[167],"QFT,":[169],"37.47%":[171],"RRA":[173],"average.":[175]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2026-06-12T00:00:00"}