{"id":"https://openalex.org/W1601487284","doi":null,"title":"A linear programming heuristic for optimal planning","display_name":"A linear programming heuristic for optimal planning","publication_year":1997,"publication_date":"1997-07-27","ids":{"openalex":"https://openalex.org/W1601487284","mag":"1601487284"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.31.5439","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.31.5439","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.utsa.edu/research/AI/bylander/pubs/aaai97plan.ps.gz","raw_type":"text"},"volume":null,"type":"article","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/A5111894028","display_name":"Tom Bylander","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I45438204","display_name":"The University of Texas at San Antonio","ror":"https://ror.org/01kd65564","country_code":"US","type":"education","lineage":["https://openalex.org/I45438204"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Tom Bylander","raw_affiliation_strings":["The University of Texas at San Antonio, San Antonio, Texas#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The University of Texas at San Antonio, San Antonio, Texas#TAB#","institution_ids":["https://openalex.org/I45438204"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5111894028"],"corresponding_institution_ids":["https://openalex.org/I45438204"],"apc_list":null,"apc_paid":null,"fwci":2.639,"has_fulltext":false,"cited_by_count":51,"citation_normalized_percentile":{"value":0.8984375,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":87,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"694","last_page":"699"},"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":1.0,"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":1.0,"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":9.999999747378752e-05,"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.0,"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/linear-programming-heuristic","display_name":"linear programming heuristic","score":0.7580000162124634},{"id":"https://openalex.org/keywords/admissible-heuristics","display_name":"admissible heuristics","score":0.7480000257492065},{"id":"https://openalex.org/keywords/partial-order-planning","display_name":"partial-order planning","score":0.9900000095367432},{"id":"https://openalex.org/keywords/graphplan","display_name":"Graphplan","score":0.8679999709129333},{"id":"https://openalex.org/keywords/tower-of-hanoi","display_name":"Tower of Hanoi","score":0.8259999752044678},{"id":"https://openalex.org/keywords/blocks-world","display_name":"blocks world","score":0.703000009059906}],"concepts":[{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.7588828206062317},{"id":"https://openalex.org/C200246849","wikidata":"https://www.wikidata.org/wiki/Q5163226","display_name":"Consistent heuristic","level":5,"score":0.6859461665153503},{"id":"https://openalex.org/C2776999362","wikidata":"https://www.wikidata.org/wiki/Q2349274","display_name":"Planner","level":2,"score":0.6031352281570435},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5639082789421082},{"id":"https://openalex.org/C114290370","wikidata":"https://www.wikidata.org/wiki/Q1415915","display_name":"Null-move heuristic","level":3,"score":0.5538455843925476},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5523343086242676},{"id":"https://openalex.org/C139979381","wikidata":"https://www.wikidata.org/wiki/Q17056021","display_name":"Incremental heuristic search","level":4,"score":0.5513272285461426},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5266100168228149},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.46055829524993896},{"id":"https://openalex.org/C114073186","wikidata":"https://www.wikidata.org/wiki/Q2631895","display_name":"Automated planning and scheduling","level":2,"score":0.4438386559486389},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3876466453075409},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.31696072220802307},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.2921409010887146},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.2652365565299988},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.23585060238838196},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.31.5439","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.31.5439","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.utsa.edu/research/AI/bylander/pubs/aaai97plan.ps.gz","raw_type":"text"},{"id":"mag:1601487284","doi":null,"is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/conf/aaai/aaai97.html#Bylander97a","pdf_url":null,"source":{"id":"https://openalex.org/S4306420577","display_name":"National Conference on Artificial Intelligence","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":"National Conference on Artificial Intelligence","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W4789806","https://openalex.org/W23603061","https://openalex.org/W28466788","https://openalex.org/W188429163","https://openalex.org/W202117100","https://openalex.org/W1590917522","https://openalex.org/W1600919542","https://openalex.org/W1667362966","https://openalex.org/W1731763842","https://openalex.org/W2022090818","https://openalex.org/W2033040247","https://openalex.org/W2045526507","https://openalex.org/W2061146398","https://openalex.org/W2079138018","https://openalex.org/W2127668611","https://openalex.org/W2130160035","https://openalex.org/W2133871179","https://openalex.org/W2164457256","https://openalex.org/W2337392266","https://openalex.org/W2611147814"],"related_works":["https://openalex.org/W1731763842","https://openalex.org/W7098702050","https://openalex.org/W1481195904","https://openalex.org/W2101174032","https://openalex.org/W1553879121","https://openalex.org/W2336946180","https://openalex.org/W205804677","https://openalex.org/W2155752154","https://openalex.org/W2019846556","https://openalex.org/W4313141474"],"abstract_inverted_index":{"I":[0],"introduce":[1],"a":[2,58,110,120,126],"new":[3],"search":[4],"heuristic":[5,24,41,49,99],"for":[6,27,50],"propositional":[7],"STRIPS":[8],"planning":[9,15,38,80],"that":[10,124],"is":[11,25,83,94,100,115,141],"based":[12],"on":[13,69],"transforming":[14],"instances":[16],"to":[17,43,64],"linear":[18,22],"programming":[19,23],"instances.":[20,81],"The":[21],"admissible":[26,48],"finding":[28,119],"minimum":[29],"length":[30],"plans":[31],"and":[32,67,78],"can":[33],"be":[34,44],"used":[35],"by":[36],"partial-order":[37,51,59],"algorithms.":[39,92],"This":[40],"appears":[42],"the":[45,62,70,87,90,98,116],"first":[46],"non-trivial":[47],"planning.":[52],"An":[53],"empirical":[54],"study":[55,88],"compares":[56],"Lplan,":[57],"planner":[60],"incorporating":[61],"heuristic,":[63],"Graphplan,":[65],"Satplan,":[66],"UCPOP":[68],"tower":[71],"of":[72,118,122],"Hanoi":[73],"domain,":[74],"random":[75,79],"blocks-world":[76],"instances,":[77],"Graphplan":[82],"far":[84],"faster":[85],"in":[86,144],"than":[89],"other":[91],"Lplan":[93,103],"often":[95,108],"slower":[96],"because":[97,106],"time-consuming,":[101],"but":[102],"shows":[104],"promise":[105],"it":[107],"performs":[109],"small":[111],"search.":[112],"Introduction":[113],"Planning":[114],"problem":[117],"combination":[121],"actions":[123],"achieves":[125],"goal":[127],"(Allen,":[128],"Hendler,":[129,133],"&":[130,135],"Tate":[131],"1990;":[132],"Tate,":[134],"Drummond":[136],"1990).":[137],"So":[138],"far,":[139],"there":[140],"limited":[142],"success":[143],"general-purpose...":[145]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":5},{"year":2012,"cited_by_count":4}],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2016-06-24T00:00:00"}