{"id":"https://openalex.org/W2080827710","doi":"https://doi.org/10.1142/s0218213004001806","title":"SUBGOAL PARTITIONING AND GLOBAL SEARCH FOR SOLVING TEMPORAL PLANNING PROBLEMS IN MIXED SPACE","display_name":"SUBGOAL PARTITIONING AND GLOBAL SEARCH FOR SOLVING TEMPORAL PLANNING PROBLEMS IN MIXED SPACE","publication_year":2004,"publication_date":"2004-12-01","ids":{"openalex":"https://openalex.org/W2080827710","doi":"https://doi.org/10.1142/s0218213004001806","mag":"2080827710"},"language":"en","primary_location":{"id":"doi:10.1142/s0218213004001806","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218213004001806","pdf_url":null,"source":{"id":"https://openalex.org/S178780388","display_name":"International Journal of Artificial Intelligence Tools","issn_l":"0218-2130","issn":["0218-2130","1793-6349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal on Artificial Intelligence Tools","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/A5080392568","display_name":"Benjamin W. Wah","orcid":"https://orcid.org/0000-0002-2335-3904"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"BENJAMIN W. WAH","raw_affiliation_strings":["Department of Electrical and Computer Engineering and the Coordinated Science Laboratory, University of Illinois, Urbana-Champaign, Urbana, IL 61801, United States of America"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering and the Coordinated Science Laboratory, University of Illinois, Urbana-Champaign, Urbana, IL 61801, United States of America","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100393447","display_name":"Yixin Chen","orcid":"https://orcid.org/0000-0002-6605-1615"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"YIXIN CHEN","raw_affiliation_strings":["Department of Computer Science and the Coordinated Science Laboratory, University of Illinois, Urbana-Champaign, Urbana, IL 61801, United States of America"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and the Coordinated Science Laboratory, University of Illinois, Urbana-Champaign, Urbana, IL 61801, United States of America","institution_ids":["https://openalex.org/I157725225"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I157725225"],"apc_list":null,"apc_paid":null,"fwci":4.1219,"has_fulltext":false,"cited_by_count":23,"citation_normalized_percentile":{"value":0.93933525,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"13","issue":"04","first_page":"767","last_page":"790"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10906","display_name":"AI-based Problem Solving and Planning","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T10906","display_name":"AI-based Problem Solving and Planning","score":0.9998000264167786,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9993000030517578,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9933000206947327,"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.7844154834747314},{"id":"https://openalex.org/keywords/maxima-and-minima","display_name":"Maxima and minima","score":0.7700628042221069},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5835515260696411},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5817475318908691},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5735419392585754},{"id":"https://openalex.org/keywords/time-horizon","display_name":"Time horizon","score":0.5203218460083008},{"id":"https://openalex.org/keywords/penalty-method","display_name":"Penalty method","score":0.5121345520019531},{"id":"https://openalex.org/keywords/saddle-point","display_name":"Saddle point","score":0.4899803698062897},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.4365385174751282},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.43292784690856934},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.27489227056503296},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.13410139083862305}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7844154834747314},{"id":"https://openalex.org/C186633575","wikidata":"https://www.wikidata.org/wiki/Q845060","display_name":"Maxima and minima","level":2,"score":0.7700628042221069},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5835515260696411},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5817475318908691},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5735419392585754},{"id":"https://openalex.org/C28761237","wikidata":"https://www.wikidata.org/wiki/Q7805321","display_name":"Time horizon","level":2,"score":0.5203218460083008},{"id":"https://openalex.org/C6180225","wikidata":"https://www.wikidata.org/wiki/Q3411771","display_name":"Penalty method","level":2,"score":0.5121345520019531},{"id":"https://openalex.org/C2681867","wikidata":"https://www.wikidata.org/wiki/Q690935","display_name":"Saddle point","level":2,"score":0.4899803698062897},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.4365385174751282},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.43292784690856934},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.27489227056503296},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.13410139083862305},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0218213004001806","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218213004001806","pdf_url":null,"source":{"id":"https://openalex.org/S178780388","display_name":"International Journal of Artificial Intelligence Tools","issn_l":"0218-2130","issn":["0218-2130","1793-6349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal on Artificial Intelligence Tools","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","score":0.4099999964237213,"display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W4789806","https://openalex.org/W43785935","https://openalex.org/W1479694349","https://openalex.org/W1508766991","https://openalex.org/W1531806910","https://openalex.org/W1545688112","https://openalex.org/W1553069021","https://openalex.org/W1568398390","https://openalex.org/W1590012787","https://openalex.org/W1600919542","https://openalex.org/W1656881631","https://openalex.org/W1661188838","https://openalex.org/W2025460523","https://openalex.org/W2028630964","https://openalex.org/W2044459544","https://openalex.org/W2099945668","https://openalex.org/W2101512350","https://openalex.org/W2104802111","https://openalex.org/W2105479009","https://openalex.org/W2119709400","https://openalex.org/W2119710578","https://openalex.org/W2122054842","https://openalex.org/W2130660558","https://openalex.org/W2132870943","https://openalex.org/W2160766833","https://openalex.org/W2164322797","https://openalex.org/W2169657394","https://openalex.org/W2317002898","https://openalex.org/W2745291127","https://openalex.org/W2798766386","https://openalex.org/W4233120796","https://openalex.org/W4254313632"],"related_works":["https://openalex.org/W1996762907","https://openalex.org/W131971937","https://openalex.org/W2095858157","https://openalex.org/W1557737441","https://openalex.org/W2324860879","https://openalex.org/W2752635268","https://openalex.org/W3100522340","https://openalex.org/W2021599769","https://openalex.org/W2056823902","https://openalex.org/W4234513027"],"abstract_inverted_index":{"We":[0],"study":[1],"in":[2,56,70,99,110,122,135,156,184,198,211,226,234,238],"this":[3,136,167],"paper":[4],"the":[5,8,22,25,40,57,61,71,85,115,127,131,174,205,223],"partitioning":[6],"of":[7,10,27,42,60,108,114,126,164,191],"constraints":[9,30,83,95,175,183],"a":[11,48,78,119,123,151,192,227],"temporal":[12,86],"planning":[13],"problem":[14],"by":[15,176],"subgoals,":[16],"their":[17],"sequential":[18],"evaluation":[19],"before":[20],"parallelizing":[21],"actions,":[23],"and":[24,39,66,178,236],"resolution":[26],"inconsistent":[28],"global":[29,94,120,133,182],"across":[31],"subgoals.":[32,200,219],"Using":[33,220],"an":[34,105,111,157,161,202],"\u2113":[35,62],"1":[36,63],"-penalty":[37,64],"formulation":[38],"theory":[41],"extended":[43,162],"saddle":[44],"points,":[45],"we":[46,169,230],"propose":[47,170],"global-search":[49],"strategy":[50],"that":[51,81,96,104,153,188],"looks":[52],"for":[53,67,160],"local":[54,68],"minima":[55],"original-variable":[58],"space":[59],"function":[65],"maxima":[69],"penalty":[72],"space.":[73],"Our":[74],"approach":[75,203],"improves":[76],"over":[77],"previous":[79,89],"scheme":[80,90],"partitions":[82],"along":[84],"horizon.":[87,128],"The":[88],"leads":[91],"to":[92,142,150,171,179,186,214,217],"many":[93],"relate":[97],"states":[98,109],"adjacent":[100],"stages,":[101,147],"which":[102],"means":[103],"incorrect":[106,208],"assignment":[107],"earlier":[112],"stage":[113,125],"horizon":[116],"may":[117],"violate":[118],"constraint":[121,134],"later":[124],"To":[129],"resolve":[130],"violated":[132],"case,":[137],"state":[138,189,209],"changes":[139],"will":[140],"need":[141],"propagate":[143,215],"sequentially":[144],"through":[145],"multiple":[146],"often":[148],"leading":[149],"search":[152],"gets":[154],"stuck":[155],"infeasible":[158],"point":[159],"period":[163],"time.":[165],"In":[166],"paper,":[168],"partition":[172],"all":[173],"subgoals":[177],"add":[180],"new":[181],"order":[185],"ensure":[187],"assignments":[190,210],"subgoal":[193,213],"are":[194],"consistent":[195],"with":[196],"those":[197],"other":[199,218],"Such":[201],"allows":[204],"information":[206],"on":[207],"one":[212],"quickly":[216],"MIPS":[221],"as":[222],"basic":[224],"planner":[225],"partitioned":[228],"implementation,":[229],"demonstrate":[231],"significant":[232],"improvements":[233],"time":[235],"quality":[237],"solving":[239],"some":[240],"PDDL2.1":[241],"benchmark":[242],"problems.":[243]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":3},{"year":2014,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}