{"id":"https://openalex.org/W2313634429","doi":"https://doi.org/10.1109/tciaig.2015.2421493","title":"Optimization Using Boundary LookupJump Point Search","display_name":"Optimization Using Boundary LookupJump Point Search","publication_year":2015,"publication_date":"2015-04-10","ids":{"openalex":"https://openalex.org/W2313634429","doi":"https://doi.org/10.1109/tciaig.2015.2421493","mag":"2313634429"},"language":"en","primary_location":{"id":"doi:10.1109/tciaig.2015.2421493","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tciaig.2015.2421493","pdf_url":null,"source":{"id":"https://openalex.org/S4210179349","display_name":"IEEE Transactions on Computational Intelligence and AI in Games","issn_l":"1943-068X","issn":["1943-068X","1943-0698"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Computational Intelligence and AI in Games","raw_type":"journal-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/A5088037842","display_name":"Jason Traish","orcid":null},"institutions":[{"id":"https://openalex.org/I153230381","display_name":"Charles Sturt University","ror":"https://ror.org/00wfvh315","country_code":"AU","type":"education","lineage":["https://openalex.org/I153230381"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Jason Traish","raw_affiliation_strings":["Charles Sturt University, Kelso, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Charles Sturt University, Kelso, Australia","institution_ids":["https://openalex.org/I153230381"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5050357566","display_name":"James Tulip","orcid":null},"institutions":[{"id":"https://openalex.org/I153230381","display_name":"Charles Sturt University","ror":"https://ror.org/00wfvh315","country_code":"AU","type":"education","lineage":["https://openalex.org/I153230381"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"James Tulip","raw_affiliation_strings":["Charles Sturt University, Kelso, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Charles Sturt University, Kelso, Australia","institution_ids":["https://openalex.org/I153230381"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109049733","display_name":"Wayne Moore","orcid":null},"institutions":[{"id":"https://openalex.org/I153230381","display_name":"Charles Sturt University","ror":"https://ror.org/00wfvh315","country_code":"AU","type":"education","lineage":["https://openalex.org/I153230381"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Wayne Moore","raw_affiliation_strings":["The Mining Lab, Charles Sturt University, Bathurst, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The Mining Lab, Charles Sturt University, Bathurst, Australia","institution_ids":["https://openalex.org/I153230381"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.7013,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.77449379,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"8","issue":"3","first_page":"268","last_page":"277"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9983999729156494,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9983999729156494,"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/T11106","display_name":"Data Management and Algorithms","score":0.9968000054359436,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9944999814033508,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7109174728393555},{"id":"https://openalex.org/keywords/jump","display_name":"Jump","score":0.7027946710586548},{"id":"https://openalex.org/keywords/cache","display_name":"Cache","score":0.6058295369148254},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5938193202018738},{"id":"https://openalex.org/keywords/boundary","display_name":"Boundary (topology)","score":0.5544561147689819},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4505329132080078},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.4420098066329956},{"id":"https://openalex.org/keywords/lookup-table","display_name":"Lookup table","score":0.43644845485687256},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.37772178649902344},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17719990015029907},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.07075425982475281}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7109174728393555},{"id":"https://openalex.org/C2780695682","wikidata":"https://www.wikidata.org/wiki/Q4005959","display_name":"Jump","level":2,"score":0.7027946710586548},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.6058295369148254},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5938193202018738},{"id":"https://openalex.org/C62354387","wikidata":"https://www.wikidata.org/wiki/Q875399","display_name":"Boundary (topology)","level":2,"score":0.5544561147689819},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4505329132080078},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.4420098066329956},{"id":"https://openalex.org/C134835016","wikidata":"https://www.wikidata.org/wiki/Q690265","display_name":"Lookup table","level":2,"score":0.43644845485687256},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.37772178649902344},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17719990015029907},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.07075425982475281},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"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":1,"locations":[{"id":"doi:10.1109/tciaig.2015.2421493","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tciaig.2015.2421493","pdf_url":null,"source":{"id":"https://openalex.org/S4210179349","display_name":"IEEE Transactions on Computational Intelligence and AI in Games","issn_l":"1943-068X","issn":["1943-068X","1943-0698"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Computational Intelligence and AI in Games","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320320961","display_name":"Charles Sturt University","ror":"https://ror.org/00wfvh315"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W135651235","https://openalex.org/W1772276748","https://openalex.org/W2111107602","https://openalex.org/W2189503459","https://openalex.org/W2397340931","https://openalex.org/W2401484145","https://openalex.org/W2405176066","https://openalex.org/W2408436805","https://openalex.org/W3022683862","https://openalex.org/W6676527066","https://openalex.org/W6687222037","https://openalex.org/W6712700185","https://openalex.org/W6713010797","https://openalex.org/W6713842110","https://openalex.org/W6776694869"],"related_works":["https://openalex.org/W2798215405","https://openalex.org/W2990962948","https://openalex.org/W2084169748","https://openalex.org/W2127529229","https://openalex.org/W2355515259","https://openalex.org/W2124289628","https://openalex.org/W1822998120","https://openalex.org/W2351666715","https://openalex.org/W2165625444","https://openalex.org/W1762720839"],"abstract_inverted_index":{"Cache-based":[0],"path-finding":[1,177],"algorithms":[2,15],"lose":[3],"much":[4,69,122],"of":[5,52,58,70,85,92,102,152,159,186,191],"their":[6],"advantage":[7],"in":[8,74,79,94,110,131,135,163],"dynamic":[9,98,111,136],"environments":[10,112],"where":[11],"fast":[12,25,176],"online":[13],"search":[14,20,43,160],"are":[16,87,113,148],"required.":[17],"Jump":[18],"point":[19,42],"(JPS)":[21],"is":[22,45,120,127],"such":[23],"a":[24,46,142,174,184],"algorithm.":[26,82],"It":[27,126],"works":[28],"by":[29],"eliminating":[30],"most":[31],"map":[32,187],"nodes":[33],"from":[34],"evaluation":[35],"during":[36],"path":[37],"expansion.":[38],"Boundary":[39],"lookup":[40,66],"jump":[41,77],"(BL-JPS)":[44],"modification":[47],"that":[48,118,180],"improves":[49],"the":[50,56,71,80,90,150,157],"speed":[51],"JPS.":[53,125],"BL-JPS":[54,93,119,138,172],"records":[55],"positions":[57],"obstacle":[59],"boundaries":[60],"and":[61,97,189],"uses":[62],"these":[63],"via":[64],"direct":[65],"to":[67,105],"eliminate":[68],"iteration":[72],"involved":[73],"searching":[75],"for":[76,108,141],"points":[78],"JPS":[81],"Two":[83],"sets":[84],"experiments":[86],"presented,":[88],"demonstrating":[89],"effects":[91,101,151,158],"both":[95],"static":[96,132],"environments.":[99],"The":[100],"different":[103],"approaches":[104],"cache":[106,153],"rebuilding":[107,154],"JPS+":[109,130,140,164,170,182],"also":[114],"evaluated.":[115],"Results":[116],"show":[117],"generally":[121],"faster":[123],"than":[124,129],"slower":[128],"environments,":[133,137],"but":[134],"outperforms":[139,181],"single":[143],"search.":[144],"When":[145],"multiple":[146],"paths":[147,192],"searched,":[149],"gradually":[155],"dominate":[156],"speed,":[161],"resulting":[162],"again":[165],"becoming":[166],"faster.":[167],"However,":[168],"combining":[169],"with":[171],"provides":[173],"very":[175],"algorithm":[178],"(BL-JPS+)":[179],"over":[183],"range":[185],"types":[188],"numbers":[190],"searched.":[193]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2016-06-24T00:00:00"}