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.

We consider the problem of designing lines in a public transport system, where we include user-optimal route choice. The model we develop ensures that there is enough capacity present for every passenger to travel on a shortest route. We present two different integer programming formulations for this problem, and discuss exact solution approaches. To solve large-scale line planning instances, w...

This paper presents a provably correct and efficient, polynomial time, planning tool and its application to a miniature assembly line for toy cars. Although somewhat limited, this process has many similarities with real industrial processes. One of our previous polynomial-time planning algorithms has been extended and adapted to work for a larger class of planning problems, including this parti...

In this paper we study a notion of topological complexity TC(X) for the motion planning problem. TC(X) is a number which measures discontinuity of the process of motion planning in the configuration space X. More precisely, TC(X) is the minimal number k such that there are k different “motion planning rules”, each defined on an open subset of X×X, so that each rule is continuous in the source a...

Abstract. We present a game-theoretic model for the line planning problem in public transportation, in which each line acts as player and aims to minimize a cost function which is related to the traffic along its edges. We analyze the model and in particular show that a potential function exists. Based on this result, we present a method for calculating equilibria and present first numerical re...

This paper aims to develop a research model to explain managers’ intentions to switch toward cloud based ERP (Enterprise Resources Planning). Indeed, as cloud computing is considered as a true revolution in Information Technologies field, ERP market is shaping toward more cloud based solutions. However, since cloud computing is presented as a risky alternative, cloud ERP adoption may faces reti...

This paper presents a vision framework which enables feature-oriented appearance-based navigation in large outdoor environments containing other moving objects. The framework is based on a hybrid topological–geometrical environment representation, constructed from a learning sequence acquired during a robot motion under human control. At the higher topological layer, the representation contains...