Computing solutions to intractable planning problems is particularly problematic within real-time domains. One approach to this problem includes off-line computation of contingency plans. However, because complex domains preclude creating a comprehensive library, a systemmust choose a subset of all possible plans to include. Strategic selections will ensure that the library contains an appropri...

In this paper we present a hybrid local-global path planning scheme for the problem of operating a moving agent inside an unknown environment in a collision-free manner. The path planning algorithm is based on information gathered on-line by the available on-board sensor devices. The solution minimizes the total length of the path with respect to a metric that includes actual path length along ...

Assortment planning is the process in which a retailer selects a product line to offer to customers and is a key determinant of a retailer’s profit. We consider the assortment planning problem using a locational choice model for customer product selection and allow for both horizontal and vertical product differentiation. When the distribution of customer preference is unimodal, the optimal sol...

ly, the motion planning problem is that of computing a path between two points in the topological space FP. In the rst two of ve seminal papers on the \Piano Movers' Problem" ([220{222, 229, 223], collected in the book [131]), Schwartz and Sharir show that the boundary of FP is a semialgebraic set (assuming the original constraints of the problem are semialgebraic). This then allows the motion ...

Motion planning for multiple entities or a crowd is a challenging problem in today’s virtual environments. We describe in this paper a system designed to simulate pedestrian behaviour in crowds in real time, concentrating particularly on collision avoidance. On-line planning is also referred to as the navigation problem. Additional difficulties in approaching navigation problem are that some en...

in many real world assembly line systems which the work-piece is of large size more than one worker work on the same work-piece in each station. this type of assembly line is called multi-manned assembly line (mal). in the classical multi-manned assembly line balancing problem (malbp) the objective is to minimize the manpower needed to manufacture one product unit. apart from the manpower, othe...

The idea of answer set programming is to represent a given computational problem by a logic program whose answer sets correspond to solutions, and then use an answer set solver, such as smodels or dlv, to nd an answer set for this program. Applications of this method to planning are related to the line of research on the frame problem that started with the invention of formal nonmonotonic reaso...

Given a robot in an environment composed of some set of obstacles and initial and nal positions of the robot within this environment, the motion planning problem involves nding a sequence of motions that move the robot from the initial to the nal position without intersecting any of the obstacles. Though polynomial-time algorithms are known for this problem for very limited kinds of robots, e.g...