<?xml version="1.0" encoding="UTF-8"?>
<StrategicPlan xmlns="urn:ISO:std:iso:17469:tech:xsd:stratml_core" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="urn:ISO:std:iso:17469:tech:xsd:stratml_core http://xml.govwebs.net/stratml/references/StrategicPlanISOVersion20140401.xsd"><Name>About LAPKT</Name><Description>LAPKT is an open-source Toolkit written in C++ and Python with simple interfaces that give you complete flexibility by decoupling parsers from problem representations and algorithms.
It has been successfully used in embedded systems, webservices, compilations, replanning and contains some of the high-performance planners from the last International Planning Competition 2014.</Description><OtherInformation>Errandum IPC 2014 Agile track -- 
Once we fixed the bug on the submission of IPC'8 (International Planning Competition 2014), we were computing h^2 but not using it, our planners BFS_f, DFS+, and SIW+ are the fastest in the AGILE track (minimize CPU time) compared to the last winner, according to our experiments.

Planners time, coverage and solution quality media:results_agile_track_2014.pdf
you can download the bug-free code media:ipc14-bfs_f_siw_bugfree.tar.bz2 or alternatively go to Download, get the LAPKT sourcecode and at the root of the toolkit use the following script</OtherInformation><StrategicPlanCore><Organization><Name>Lightweight Automated Planning ToolKiT</Name><Acronym>LAPKT</Acronym><Identifier>_99773a46-da9b-11e7-ac60-784fab18c257</Identifier><Description/><Stakeholder StakeholderTypeType="Generic_Group"><Name>Planning Community</Name><Description>We welcome anybody in the planning community to contribute into LAPKT, either by just using it or by submitting code implementing stuff they feel should be in an "Automated Planning Toolkit". We only request two things from you. First, to abide to the terms and conditions of the GNU Lesser General Public License (http://www.gnu.org/copyleft/lesser.html). Second, to drop a note on us telling about what you plan to add or what you think should be changed.

You can contribute to LAPKT by submitting code or patches to admin@lapkt.org or through the github repository.

Forum / public mailing list: LAPKT Google Group (intended for users and non-core developers)
internal mailing list: LAPKT-dev Google Group (intended for internal discussions between the core developers)
general questions: Miquel Ramirez and Nir Lipovetzky &lt;admin@lapkt.org&gt;</Description></Stakeholder><Stakeholder StakeholderTypeType="Person"><Name>Miquel Ramirez</Name><Description/></Stakeholder><Stakeholder StakeholderTypeType="Person"><Name>Nir Lipovetzky</Name><Description/></Stakeholder></Organization><Vision><Description>Your life becomes easier</Description><Identifier>_99773b0e-da9b-11e7-ac60-784fab18c257</Identifier></Vision><Mission><Description>To enable creation, usage and extension of basic to advanced Automated Planners.</Description><Identifier>_99773b90-da9b-11e7-ac60-784fab18c257</Identifier></Mission><Value><Name>Open Source</Name><Description/></Value><Value><Name>Modularity</Name><Description>Search engine components are meant to be modular, allowing users of LAPKT to assemble and combine features of different search engines to come up with customized search strategies, within reason and without sacrificing (much) efficiency.</Description></Value><Value><Name>Strategy</Name><Description>In order to do so, LAPKT makes heavy use of C++ templates and the Static Strategy design pattern.</Description></Value><Value><Name>Patterns</Name><Description/></Value><Goal><Name>Planning Tasks</Name><Description>Separate search engines from the data structures used to represent planning tasks.</Description><Identifier>_99773d48-da9b-11e7-ac60-784fab18c257</Identifier><SequenceIndicator/><Stakeholder><Name/><Description/></Stakeholder><OtherInformation>LAPKT separates search engines from the data structures used to represent planning tasks. This second component receives the name of ‘interface’ since it is indeed the interface that provides the search model to be solved.</OtherInformation><Objective><Name>Existing Interfaces</Name><Description>Maintain existing interfaces</Description><Identifier>_99773de8-da9b-11e7-ac60-784fab18c257</Identifier><SequenceIndicator>1</SequenceIndicator><Stakeholder><Name/><Description/></Stakeholder><OtherInformation>At the moment of writing this, the following interfaces are offered:</OtherInformation></Objective><Objective><Name>Agnostic Parsing</Name><Description>Separate parsing representation of planning tasks from a representation optimized for off-line planning.</Description><Identifier>_99773e74-da9b-11e7-ac60-784fab18c257</Identifier><SequenceIndicator>1.1</SequenceIndicator><Stakeholder><Name/><Description/></Stakeholder><OtherInformation>‘agnostic’: this interface does not depend on a particular planning language, so it is easy to wrap PDDL parsers, separating parsing representation of planning tasks from a representation optimized for off-line planning. This interface should also make easy to integrate STRIPS planners into applications by suitably defining planning tasks programatically.</OtherInformation></Objective><Objective><Name>FF Parsing</Name><Description>Wrap FF parsing components</Description><Identifier>_99773ef6-da9b-11e7-ac60-784fab18c257</Identifier><SequenceIndicator>1.2</SequenceIndicator><Stakeholder><Name/><Description/></Stakeholder><OtherInformation>'ff': this interface wraps FF parsing components to obtain 'agnostic' looking tasks.</OtherInformation></Objective><Objective><Name>FD Parsing</Name><Description>Wrap FD parsing components </Description><Identifier>_99773f6e-da9b-11e7-ac60-784fab18c257</Identifier><SequenceIndicator>1.3</SequenceIndicator><Stakeholder><Name/><Description/></Stakeholder><OtherInformation>'fd': this interface wraps FD parsing components to obtain 'agnostic' looking tasks.</OtherInformation></Objective><Objective><Name>Additional Interfaces</Name><Description>Develop additional interfaces.</Description><Identifier>_99773ff0-da9b-11e7-ac60-784fab18c257</Identifier><SequenceIndicator>2</SequenceIndicator><Stakeholder><Name/><Description/></Stakeholder><OtherInformation>Future interfaces planned are:</OtherInformation></Objective><Objective><Name>VAL Interface</Name><Description>Wrap VAL parser.</Description><Identifier>_99774072-da9b-11e7-ac60-784fab18c257</Identifier><SequenceIndicator>2.1</SequenceIndicator><Stakeholder><Name/><Description/></Stakeholder><OtherInformation>'VAL': this interface wraps VAL parser, which supports parsing of PDDL+ features.</OtherInformation></Objective><Objective><Name>SAS Interface</Name><Description>Support SAS representations natively.</Description><Identifier>_997740f4-da9b-11e7-ac60-784fab18c257</Identifier><SequenceIndicator>2.2</SequenceIndicator><Stakeholder><Name/><Description/></Stakeholder><OtherInformation>‘SAS+’: this interface is meant to support SAS representations natively. Since there is no SAS-based planning language, this will probably be useful to integrate planners into applications that are able to define SAS planning tasks programatically.</OtherInformation></Objective></Goal></StrategicPlanCore><AdministrativeInformation><StartDate>2015-02-16</StartDate><PublicationDate>2017-12-06</PublicationDate><Source>http://lapkt.org/index.php?title=Main_Page</Source><Submitter><GivenName>Owen</GivenName><Surname>Ambur</Surname><PhoneNumber/><EmailAddress>Owen.Ambur@verizon.net</EmailAddress></Submitter></AdministrativeInformation></StrategicPlan>