{"id":"https://openalex.org/W43785935","doi":null,"title":"Automated planning and scheduling using calculus of variations in discrete space","display_name":"Automated planning and scheduling using calculus of variations in discrete space","alternate_titles":[],"publication_year":2003,"publication_date":"2003-06-09","ids":{"openalex":"https://openalex.org/W43785935","mag":"43785935"},"language":"en","primary_location":{"id":"mag:43785935","doi":null,"is_oa":false,"landing_page_url":"https://www.aaai.org/Papers/ICAPS/2003/ICAPS03-001.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306419157","display_name":"International Conference on Automated Planning and Scheduling","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"International Conference on Automated Planning and Scheduling","raw_type":null},"parent_works":[],"lineage":["https://openalex.org/W43785935"],"child_works_count":0,"type":"conference-paper","is_traditional":true,"indexed_in":[],"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/A5100393447","display_name":"Yixin Chen","orcid":"https://orcid.org/0000-0002-6605-1615","observed_orcids":["https://orcid.org/0000-0002-6605-1615","https://orcid.org/0009-0000-6853-5915"]},"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,"contributor_roles":[],"raw_author_name":"Yixin Chen","raw_affiliation_strings":["Department of Electrical and Computer Engineering and the Coordinated Science Laboratory, University of Illinois, Urbana-Champaign, Urbana, IL"],"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","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5080392568","display_name":"Benjamin Wan-Sang Wah","orcid":"https://orcid.org/0000-0002-2335-3904","observed_orcids":["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,"contributor_roles":[],"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"],"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","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":2.1784,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.87688066,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":86,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"2","last_page":"11"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10906","display_name":"AI-based Problem Solving and Planning","score":0.7681000232696533,"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.7681000232696533,"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.16369999945163727,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.03959999978542328,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/automated-planning","display_name":"automated planning","score":0.9419999718666077},{"id":"https://openalex.org/keywords/scheduling","display_name":"scheduling","score":0.890999972820282},{"id":"https://openalex.org/keywords/calculus-of-variations","display_name":"calculus of variations","score":0.9810000061988831},{"id":"https://openalex.org/keywords/dominance-relationships","display_name":"dominance relations","score":0.8640000224113464},{"id":"https://openalex.org/keywords/saddle-point-conditions","display_name":"saddle point conditions","score":0.8069999814033508},{"id":"https://openalex.org/keywords/state-space-pruning","display_name":"state space pruning","score":0.6079999804496765},{"id":"https://openalex.org/keywords/search-algorithms","display_name":"search algorithms","score":0.5260000228881836},{"id":"https://openalex.org/keywords/spacecraft-scheduling","display_name":"spacecraft scheduling","score":0.9789999723434448}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6272660493850708},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.5517586469650269},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5012562274932861},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4878404140472412},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4366626441478729},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.4201546013355255},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.11304458975791931},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.11051985621452332},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C6557445","wikidata":"https://www.wikidata.org/wiki/Q173113","display_name":"Agronomy","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"mag:43785935","doi":null,"is_oa":false,"landing_page_url":"https://www.aaai.org/Papers/ICAPS/2003/ICAPS03-001.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306419157","display_name":"International Conference on Automated Planning and Scheduling","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"International Conference on Automated Planning and Scheduling","raw_type":null},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.563.4177","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.563.4177","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://www.aaai.org/Papers/ICAPS/2003/ICAPS03-001.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.8.6144","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.8.6144","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://manip.crhc.uiuc.edu/Wah/papers/C145/C145.ps.gz","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W56131250","https://openalex.org/W1508766991","https://openalex.org/W1517538517","https://openalex.org/W1531806910","https://openalex.org/W1545688112","https://openalex.org/W1553069021","https://openalex.org/W1600919542","https://openalex.org/W1656881631","https://openalex.org/W1661188838","https://openalex.org/W1823143263","https://openalex.org/W1890280524","https://openalex.org/W1982647060","https://openalex.org/W2013563090","https://openalex.org/W2023242456","https://openalex.org/W2025460523","https://openalex.org/W2028630964","https://openalex.org/W2079914542","https://openalex.org/W2095241583","https://openalex.org/W2104802111","https://openalex.org/W2105479009","https://openalex.org/W2122054842","https://openalex.org/W2132870943","https://openalex.org/W2140768207","https://openalex.org/W2160766833","https://openalex.org/W2164322797","https://openalex.org/W2167189550","https://openalex.org/W2341171179","https://openalex.org/W2745291127","https://openalex.org/W2911346016"],"related_works":["https://openalex.org/W7097900392","https://openalex.org/W7096898750","https://openalex.org/W2142232700","https://openalex.org/W7096270499","https://openalex.org/W7095470804","https://openalex.org/W2981989950","https://openalex.org/W2562653619","https://openalex.org/W2169657394","https://openalex.org/W7004909783","https://openalex.org/W145978091"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,119,142],"propose":[4,84],"new":[5],"dominance":[6,35,117],"relations":[7],"that":[8,33,47,53,74,106,136],"can":[9],"speed":[10],"up":[11],"significantly":[12],"the":[13,57,81,89,139,144,153],"solution":[14,164],"process":[15],"of":[16,59,91,98,146],"planning":[17,101,171],"problems":[18],"formulated":[19],"as":[20,133],"nonlinear":[21],"constrained":[22],"dynamic":[23,37],"optimization":[24],"in":[25,36,56,63,67,75,88,95,152,160],"discrete":[26,76],"time":[27,162],"and":[28,52,156,163,170],"space.":[29,77],"We":[30],"first":[31,82],"show":[32,157],"path":[34],"programming":[38],"cannot":[39,70],"be":[40,71],"applied":[41],"when":[42],"there":[43],"are":[44],"general":[45],"constraints":[46],"span":[48],"across":[49],"multiple":[50],"stages,":[51],"node":[54],"dominance,":[55],"form":[58,90],"Euler-Lagrange":[60],"conditions":[61,94],"developed":[62],"optimal":[64,112],"control":[65],"theory":[66],"continuous":[68],"space,":[69],"extended":[72],"to":[73,83,110,135],"This":[78],"paper":[79],"is":[80],"efficient":[85,121],"node-dominance":[86],"relations,":[87,118],"local":[92],"saddle-point":[93],"each":[96],"stage":[97],"a":[99,129],"discrete-space":[100],"problem,":[102],"for":[103],"pruning":[104],"states":[105],"will":[107],"not":[108],"lead":[109],"locally":[111],"paths.":[113],"By":[114],"utilizing":[115],"these":[116],"present":[120],"search":[122],"algorithms":[123],"whose":[124],"complexity,":[125],"despite":[126],"exponential,":[127],"has":[128],"much":[130],"smaller":[131],"base":[132],"compared":[134],"without":[137],"using":[138],"relations.":[140],"Finally,":[141],"demonstrate":[143],"performance":[145],"our":[147],"approach":[148],"by":[149],"integrating":[150],"it":[151],"ASPEN":[154],"planner":[155],"significant":[158],"improvements":[159],"CPU":[161],"quality":[165],"on":[166],"some":[167],"spacecraft":[168],"scheduling":[169],"benchmarks.":[172]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W43785935","counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2023,"cited_by_count":1}],"updated_date":"2026-11-21T10:27:49.728292","created_date":"2016-06-24T00:00:00"}
