{"id":"https://openalex.org/W2013673420","doi":"https://doi.org/10.1080/09528130110063074","title":"Parallel planning via the distribution of operators","display_name":"Parallel planning via the distribution of operators","publication_year":2001,"publication_date":"2001-07-01","ids":{"openalex":"https://openalex.org/W2013673420","doi":"https://doi.org/10.1080/09528130110063074","mag":"2013673420"},"language":"en","primary_location":{"id":"doi:10.1080/09528130110063074","is_oa":false,"landing_page_url":"https://doi.org/10.1080/09528130110063074","pdf_url":null,"source":{"id":"https://openalex.org/S153467142","display_name":"Journal of Experimental & Theoretical Artificial Intelligence","issn_l":"0952-813X","issn":["0952-813X","1362-3079"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Experimental & Theoretical Artificial Intelligence","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/A5009998024","display_name":"Dimitris Vrakas","orcid":"https://orcid.org/0000-0001-8559-6269"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dimitris Vrakas","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5074769295","display_name":"Ioannis Refanidis","orcid":"https://orcid.org/0000-0003-4697-4751"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ioannis Refanidis","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5066340205","display_name":"Ioannis Vlahavas","orcid":"https://orcid.org/0000-0003-3477-8825"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ioannis Vlahavas","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.10295348,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"13","issue":"3","first_page":"211","last_page":"226"},"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.9972000122070312,"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.9972000122070312,"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.9930999875068665,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9825000166893005,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/planner","display_name":"Planner","score":0.8440554738044739},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.827457845211029},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6770029067993164},{"id":"https://openalex.org/keywords/operator","display_name":"Operator (biology)","score":0.6324530839920044},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6164879202842712},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6126797199249268},{"id":"https://openalex.org/keywords/successor-cardinal","display_name":"Successor cardinal","score":0.5705788135528564},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5371034741401672},{"id":"https://openalex.org/keywords/lift","display_name":"Lift (data mining)","score":0.5341514348983765},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.19909927248954773},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.10881233215332031},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.10152077674865723}],"concepts":[{"id":"https://openalex.org/C2776999362","wikidata":"https://www.wikidata.org/wiki/Q2349274","display_name":"Planner","level":2,"score":0.8440554738044739},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.827457845211029},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6770029067993164},{"id":"https://openalex.org/C17020691","wikidata":"https://www.wikidata.org/wiki/Q139677","display_name":"Operator (biology)","level":5,"score":0.6324530839920044},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6164879202842712},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6126797199249268},{"id":"https://openalex.org/C75306776","wikidata":"https://www.wikidata.org/wiki/Q7632662","display_name":"Successor cardinal","level":2,"score":0.5705788135528564},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5371034741401672},{"id":"https://openalex.org/C139002025","wikidata":"https://www.wikidata.org/wiki/Q3001212","display_name":"Lift (data mining)","level":2,"score":0.5341514348983765},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.19909927248954773},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.10881233215332031},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.10152077674865723},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"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/C158448853","wikidata":"https://www.wikidata.org/wiki/Q425218","display_name":"Repressor","level":4,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"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/C86339819","wikidata":"https://www.wikidata.org/wiki/Q407384","display_name":"Transcription factor","level":3,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1080/09528130110063074","is_oa":false,"landing_page_url":"https://doi.org/10.1080/09528130110063074","pdf_url":null,"source":{"id":"https://openalex.org/S153467142","display_name":"Journal of Experimental & Theoretical Artificial Intelligence","issn_l":"0952-813X","issn":["0952-813X","1362-3079"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Experimental & Theoretical Artificial Intelligence","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.24.7708","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.24.7708","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.csd.auth.gr/~lpis/people/giannis_personal/john_papers/php.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W6488013","https://openalex.org/W40726722","https://openalex.org/W45554583","https://openalex.org/W1558620469","https://openalex.org/W1579715973","https://openalex.org/W1588745704","https://openalex.org/W1644411414","https://openalex.org/W1699282338","https://openalex.org/W1731763842","https://openalex.org/W1913901177","https://openalex.org/W2025460523","https://openalex.org/W2028247234","https://openalex.org/W2054583871","https://openalex.org/W2095624907","https://openalex.org/W2131814802","https://openalex.org/W2147110864","https://openalex.org/W2152002393","https://openalex.org/W2167093312","https://openalex.org/W2337392266","https://openalex.org/W2402164836","https://openalex.org/W4301242073"],"related_works":["https://openalex.org/W2473542051","https://openalex.org/W3123320268","https://openalex.org/W2994519609","https://openalex.org/W2726593096","https://openalex.org/W2054269721","https://openalex.org/W4235459050","https://openalex.org/W2390822611","https://openalex.org/W2114709995","https://openalex.org/W4312723892","https://openalex.org/W2783065147"],"abstract_inverted_index":{"This":[0],"paper":[1],"describes":[2],"Operator":[3],"Distribution":[4],"Method":[5],"for":[6,13,98,130],"parallel":[7],"Planning":[8],"(ODMP),":[9],"a":[10,53,121,127,140],"parallelization":[11],"method":[12,18],"efficient":[14],"heuristic":[15,43,99,123,128],"planning.":[16],"The":[17],"innovates":[19],"in":[20,55],"that":[21,108],"it":[22,102],"parallelizes":[23],"the":[24,27,31,35,38,42,56,59,61,69,81,84,89,147],"application":[25],"of":[26,37,58,72,83,92,142],"available":[28],"operators":[29],"to":[30,47,106,119],"current":[32],"state":[33],"and":[34,52,125,134],"evaluation":[36],"successor":[39],"states":[40],"using":[41],"function.":[44],"In":[45],"order":[46],"achieve":[48],"better":[49],"load":[50,76],"balancing":[51,77],"lift":[54],"scalability":[57],"algorithm,":[60],"operator":[62,85],"set":[63,141],"is":[64,78,96],"initially":[65],"enlarged,":[66],"by":[67],"grounding":[68],"first":[70],"argument":[71],"each":[73],"operator.":[74],"Additional":[75],"achieved":[79],"through":[80],"reordering":[82],"set,":[86],"based":[87],"on":[88,139],"expected":[90],"amount":[91],"imposed":[93],"work.":[94],"ODMP":[95],"effective":[97],"planners,":[100],"but":[101],"can":[103],"be":[104],"applied":[105,118],"planners":[107],"embody":[109],"other":[110],"search":[111],"strategies":[112],"as":[113],"well.":[114],"It":[115],"has":[116,135],"been":[117,136],"GRT,":[120],"domain-independent":[122],"planner,":[124],"CL,":[126],"planner":[129],"simple":[131],"logistics":[132,143],"problems,":[133],"thoroughly":[137],"tested":[138],"problems":[144],"adopted":[145],"from":[146],"AIPS-98":[148],"planning":[149],"competition,":[150],"giving":[151],"quite":[152],"promising":[153],"results.":[154]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-07-29T09:40:50.615796","created_date":"2025-10-10T00:00:00"}