{"id":"https://openalex.org/W2792438551","doi":"https://doi.org/10.1109/itsc.2017.8317882","title":"Path planning for wheel loaders: A discrete optimization approach","display_name":"Path planning for wheel loaders: A discrete optimization approach","publication_year":2017,"publication_date":"2017-10-01","ids":{"openalex":"https://openalex.org/W2792438551","doi":"https://doi.org/10.1109/itsc.2017.8317882","mag":"2792438551"},"language":"en","primary_location":{"id":"doi:10.1109/itsc.2017.8317882","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itsc.2017.8317882","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE 20th International Conference on Intelligent Transportation Systems (ITSC)","raw_type":"proceedings-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/A5020273645","display_name":"Beichuan Hong","orcid":"https://orcid.org/0000-0003-4485-4019"},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Beichuan Hong","raw_affiliation_strings":["Department of Transport Science, KTH Royal Institute of Technology, Stockholm, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Transport Science, KTH Royal Institute of Technology, Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103171792","display_name":"Xiaoliang Ma","orcid":"https://orcid.org/0000-0001-5526-4511"},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Xiaoliang Ma","raw_affiliation_strings":["Department of Transport Science, KTH Royal Institute of Technology, Stockholm, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Transport Science, KTH Royal Institute of Technology, Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.2771,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.66842545,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9962000250816345,"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/T10805","display_name":"Vehicle Dynamics and Control Systems","score":0.9858999848365784,"subfield":{"id":"https://openalex.org/subfields/2203","display_name":"Automotive 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/loader","display_name":"Loader","score":0.9888535737991333},{"id":"https://openalex.org/keywords/discretization","display_name":"Discretization","score":0.7092958688735962},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5869196653366089},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5689699649810791},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4909215569496155},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.4163592755794525},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.32811659574508667},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.19402500987052917},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1205650269985199}],"concepts":[{"id":"https://openalex.org/C2779041774","wikidata":"https://www.wikidata.org/wiki/Q650550","display_name":"Loader","level":2,"score":0.9888535737991333},{"id":"https://openalex.org/C73000952","wikidata":"https://www.wikidata.org/wiki/Q17007827","display_name":"Discretization","level":2,"score":0.7092958688735962},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5869196653366089},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5689699649810791},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4909215569496155},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.4163592755794525},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.32811659574508667},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.19402500987052917},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1205650269985199},{"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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/itsc.2017.8317882","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itsc.2017.8317882","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE 20th International Conference on Intelligent Transportation Systems (ITSC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/12","display_name":"Responsible consumption and production","score":0.41999998688697815}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W223311178","https://openalex.org/W1971998222","https://openalex.org/W2026037988","https://openalex.org/W2080023708","https://openalex.org/W2098585519","https://openalex.org/W2183375285","https://openalex.org/W2209316977","https://openalex.org/W2245931582","https://openalex.org/W2292411421","https://openalex.org/W2305689833","https://openalex.org/W6690982449","https://openalex.org/W6698007650","https://openalex.org/W6884948238"],"related_works":["https://openalex.org/W2365193102","https://openalex.org/W2343312170","https://openalex.org/W2392969333","https://openalex.org/W2380220463","https://openalex.org/W2745521454","https://openalex.org/W2363418592","https://openalex.org/W2061615910","https://openalex.org/W2385186581","https://openalex.org/W2388122603","https://openalex.org/W814774360"],"abstract_inverted_index":{"In":[0],"construction":[1],"projects,":[2],"wheel":[3,15,60],"loader":[4,16,61],"is":[5,67,75],"widely":[6],"used":[7],"for":[8,27,41,69,77,88,108],"transporting":[9],"building":[10],"materials.":[11],"The":[12,73],"operations":[13],"of":[14,104],"contain":[17],"extensively":[18],"repetitive":[19],"tasks":[20],"that":[21],"could":[22],"be":[23],"optimized":[24],"and":[25,48,57,87,92],"automated":[26],"sustainable":[28],"construction.":[29],"This":[30],"paper":[31],"proposes,":[32],"according":[33],"to":[34,100],"optimal":[35,70],"control":[36],"theory,":[37],"an":[38],"optimization":[39],"approach":[40,66],"the":[42,79,83,102,105,109],"loading":[43,110],"cycle":[44,111],"concerning":[45],"fuel":[46],"efficiency":[47],"environmental":[49],"impacts.":[50],"Based":[51],"on":[52],"a":[53,58,63],"2D":[54],"space":[55],"discretization":[56],"detailed":[59],"model,":[62],"dynamic":[64],"programming":[65],"formulated":[68],"path":[71,84],"search.":[72],"method":[74],"effective":[76],"integrating":[78],"system":[80],"models":[81],"with":[82,112],"planning":[85],"algorithm":[86,107],"handling":[89],"objective":[90],"functions":[91],"constraints.":[93,114],"A":[94],"case":[95],"study":[96],"was":[97],"carried":[98],"out":[99],"demonstrate":[101],"application":[103],"proposed":[106],"spatial":[113]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}