The industry asks for formal, eecient methods for tackling dynamic systems of combinatorial nature, eg. error recovery in industrial processes. As an application example, we have used a minituare assembly line that assembles toy cars|a process that has many similarities with real industrial processes. We have tried to apply one of our provably correct, polynomial-time planning algorithms to pla...

his paper deals with visual servoing for 6-degree-of-freedom root manipulators, and considers the problem of establishing hether and how it is possible to reach the desired location while eeping all features in the field of view and following a straight ine in the Euclidean space. A path-planning technique based on a arametrization of the camera path through polynomials is proosed, which overco...

This paper addresses the management and evolution of products that comprise a configuration of reusable components. Software product lines provide an example, as their development requires the cooperation of multiple product teams that utilize common domain components. The different perspectives of the product and component teams in such environments are reviewed and contrasted, since the conce...

FACULTY OF ENGINEERING, SCIENCE AND MATHEMATICS SCHOOL OF ELECTRONICS AND COMPUTER SCIENCE Doctor of Philosophy by Jason D. R. Farquhar An on-line planning problem is one where an agent must optimise some objective criterion by making a sequence of action selection decisions, where the time and resources used in making decisions count in assessing overall solution quality. Typically in these pr...

In this paper we present a novel planning approach, based on well-known techniques such as goal decomposition and heuristic planning, aimed at working in highly dynamic environments with time constraints. Our contribution is a domainindependent planner to incrementally generate plans under a deliberative framework for reactive domains. The planner follows the anytime principles, i.e a first sol...

One of the basic problems in strategic planning of public and rail transport is the line planning problem to find a system of lines and its associated frequencies. The objectives of this planning process are usually manifold and often contradicting. The transport operator wants to minimize cost, whereas passengers want to have travel time shortest routes without any or only few changings betwee...

An important strategic element in the planning process of public transportation is the development of a line concept, i.e. to find a set of paths for operating lines on them. So far, most of the models in the literature aim to minimize the costs or to maximize the number of direct travelers. In this paper we present a new approach minimizing the travel times over all customers including penalti...

The industry wants formal methods for dealing with combinatorial dynamical systems that are provably correct and fast. One example of such problems is error recovery in industrial processes. We have used a provably correct, polynomial-time planning algorithm to plan for a miniature assembly line, which assembles toy cars. Although somewhat limited, this process has many similarities with real i...

The industry wants formal methods for dealing with combinatorial dynamical systems that are provably correct and fast. One example of such problems is error recovery in industrial processes. We have used a provably correct, polynomial-time planning algorithm to plan for a miniature assembly line, which assembles toy cars. Although somewhat limited, this process has many similarities with real i...

Using the Cybernetix case study, we display how LSCs can be used to analyze a production line systematically. This work demonstrates how the features of a scenario based object oriented modeling language are exploited in this domain. It also shows advantages of the play-in/play-out methodology.