She has (which includes a human user), while planning determines equipped the apartment with a series of service robots, the concrete actions that should be carried out in order to sensors and actuators which help her manage some of best support the perceived context. The domain description the physical and cognitive difficulties she has due to formalism used by SAM is based on metric temporal constraints; her age. Her home alerts her if she appears to be overcooking such domains model both the criteria for context inference her meals, and autonomously organizes when and the planning operators used for plan synthesis. The of the user and to contextually synthesize action plans for home recognizes when Malin is sleeping, eating and actuators in the intelligent environment. The knowledge representation scheme used in SAM is based State of the art robotic and sensor systems can be leveraged on Allen's Interval Relations (Allen 1984), augmented with to achieve intelligent functionalities that are useful in a number temporal bounds.

She has (which includes a human user), while planning determines equipped the apartment with a series of service robots, the concrete actions that should be carried out in order to sensors and actuators which help her manage some of best support the perceived context. The domain description the physical and cognitive difficulties she has due to formalism used by SAM is based on metric temporal constraints; her age. Her home alerts her if she appears to be overcooking such domains model both the criteria for context inference her meals, and autonomously organizes when and the planning operators used for plan synthesis. The of the user and to contextually synthesize action plans for home recognizes when Malin is sleeping, eating and actuators in the intelligent environment. The knowledge representation scheme used in SAM is based State of the art robotic and sensor systems can be leveraged on Allen's Interval Relations (Allen 1984), augmented with to achieve intelligent functionalities that are useful in a number temporal bounds.

She has (which includes a human user), while planning determines equipped the apartment with a series of service robots, the concrete actions that should be carried out in order to sensors and actuators which help her manage some of best support the perceived context. The domain description the physical and cognitive difficulties she has due to formalism used by SAM is based on metric temporal constraints; her age. Her home alerts her if she appears to be overcooking such domains model both the criteria for context inference her meals, and autonomously organizes when and the planning operators used for plan synthesis. The of the user and to contextually synthesize action plans for home recognizes when Malin is sleeping, eating and actuators in the intelligent environment. The knowledge representation scheme used in SAM is based State of the art robotic and sensor systems can be leveraged on Allen's Interval Relations (Allen 1984), augmented with to achieve intelligent functionalities that are useful in a number temporal bounds.

She has (which includes a human user), while planning determines equipped the apartment with a series of service robots, the concrete actions that should be carried out in order to sensors and actuators which help her manage some of best support the perceived context. The domain description the physical and cognitive difficulties she has due to formalism used by SAM is based on metric temporal constraints; her age. Her home alerts her if she appears to be overcooking such domains model both the criteria for context inference her meals, and autonomously organizes when and the planning operators used for plan synthesis. The of the user and to contextually synthesize action plans for home recognizes when Malin is sleeping, eating and actuators in the intelligent environment. The knowledge representation scheme used in SAM is based State of the art robotic and sensor systems can be leveraged on Allen's Interval Relations (Allen 1984), augmented with to achieve intelligent functionalities that are useful in a number temporal bounds.

All-pairs shortest paths (APSP) can eliminate the need to search in a graph, providing optimal moves very fast. A major challenge is storing pre-computed APSP data efficiently. Recently, compression has successfully been employed to scale the use of APSP data to roadmaps and gridmaps of realistic sizes. We develop new techniques that improve the compression power of state-of-the-art methods by up to a factor of 5. We demonstrate our ideas on game gridmpaps and the roadmap of Australia. Part of our ideas have been integrated in the Copa CPD system, one of the two best optimal participants in the grid-based path planning competition GPPC.

Many renewable sources of energy can harness greater uptime and power output when located in remote and potentially hostile locations. One example of this is wind power, wherein turbines positioned at offshore locations can experience higher and more sustained windspeeds than their onshore counterparts. However, these traits also lead to increased load and degradation upon components, which in turn means that regular maintenance is required. While onshore maintenance costs are relatively trivial, the costs associated with offshore maintenance can be several orders-of-magnitude greater. Traditionally, the scheduling of these repairs is performed by hand using a set of pre-determined plans for specific fault-categories (e.g. trivial/minor/major component replacement). This paper formulates this problem as a PDDL domain which encapsulates all of the individual pre-defined plans in a single representation, such that multiple levels of response can be integrated in a single plan. The domain presented is complex in that it contains not only numeric and temporal planning aspects, but that a subset of the domain is heavily geared towards pure scheduling. We include performance results on how a state-of-the-art planner performs on various example scenarios.

An elegant way to tackle a problem that you cannot solve is to cast it to a problem that you can solve very well. Cyclic Scheduling problems are very similar to Resource Constrained Project Scheduling Problems (RCPSP), except that the project activities are repeated over time. Due to the similarity, reducing Cyclic Scheduling problems to RCPSPs seems an appealing approach. In this paper we discuss four methods to perform the reduction. The first two are existing techniques. The remaining ones are novel and include the first (to the best of our knowledge) equivalent RCPSP formulation of a cyclic problem. We compare the presented approaches in an experimental evaluation.

In large and complex planning problems, there will almost inevitably be aspects that are not relevant to a specific problem instance. Thus, identifying and removing irrelevant parts from an instance is one of the most important techniques for scaling up automated planning. We examine the path-based relevance analysis method, which is safe (preserves plan existence and cost) and powerful but has exponential time complexity, and show how to make it run in polynomial time with only a minimal loss of pruning power.

Goal-driven automated composition of software components is an important problem with applications in Web service composition and stream processing systems. The popular approach to address this problem is to build the composition automatically using AI planning. However, it is shown that some of these planning approaches may neither be feasible nor scalable for many large-scale flow-based applications. Recent advances have proven that the automated composition problem can take advantage of expert knowledge describing the many ways in which different reusable components can be composed. This knowledge can be represented using an extensible composition template or pattern. In prior work, a flow pattern language called Cascade and its corresponding specialized planner have shown the best performance in these domains. In this paper, we propose the use of Hierarchical Task Network (HTN) planning for the composition of stream processing applications. To this end, we propose an automated approach of creating an HTN-based problem from the Cascade representation of the flow patterns. The resulting technique not only allows us to use the HTN planning paradigm and its many advantages including added expressivity but also enables optimization and customization of composition with respect to preferences and constraints. Further, we propose and develop a lookahead heuristic and show that it significantly reduces the planning time. We have performed extensive experimentation with stream processing applications and evaluated applicability and performance of our approach.

Search And Tracking (SAT) is the problem of searching for a mobile target and tracking it after it is found. As this problem has important applications in search-and-rescue and surveillance operations, recently there has been increasing interest in equipping unmanned aerial vehicles (UAVs) with autonomous SAT capabilities. State-of-the-art approaches to SAT rely on estimating the probability density function of the target's state and solving the search control problem in a greedy fashion over a short planning horizon (typically, a one-step lookahead). These techniques suffer high computational cost, making them unsuitable for complex problems. In this paper, we propose a novel approach to SAT, which allows us to handle big geographical areas, complex target motion models and long-term operations. Our solution is to track the target reactively while it is in view and to plan a recovery strategy that relocates the target every time it is lost, using a high-performing automated planning tool. The planning problem consists of deciding where to search and which search patterns to use in order to maximise the likelihood of recovering the target. We show experimental results demonstrating the potential of our approach.