One ultimate goal of power network planning is to construct power systems that are environmentally friendly. However, it is still a challenging issue to efficiently consider environmental factors in power network planning problems due to the complexity and the diversity of environment. This paper presents a nonlinear approach to formulate the multi-dimensional spatial power network planning pro...

This paper proposed a parallel automated assembly line system to produce multiple products having multiple autonomous guided vehicles (AGVs). Several assembly lines are configured to produce multiple products in which the technologies of machines are shared among the assembly lines when required. The transportation between the stations in an assembly line (intra assembly line) and among station...

In this work we present an approach to solving time-critical decision-making problems by taking advantage of domain structure to expand the amount of time available for processing difficult combinatorial tasks. Our approach uses predictable variability in computational demands to allocate on-line deliberation time and exploits problem regularity and stochastic models of environmental dynamics t...

This work addresses path planning for nonholonomic robots moving in two-dimensional space. The problem consists in computing a sequence of line segments that leads from the current configuration of the robot to a target location, while avoiding a given set of obstacles. We describe a planning algorithm that has the advantage of being very efficient, requiring less of one millisecond of CPU time...

Computing rectilinear shortest paths in two dimensions has been solved optimally using a number of different techniques. A variety of related problems have been solved, including minimizing the number of bends in the path, the total rectilinear distance, or some combination of both. However, solutions to the 3D versions of these problems are less common. We propose a solution to the 3D minimum-...

This paper discusses how to plan continuous-curvature paths for carlike wheeled mobile robots. The task is to generate a trajectory with upper-bounded curvature and curvature derivative. To solve this problem we use three path planning primitives, namely straight line segments, circular segments, and continuous-curvature turns (CC turns) in the path planning. We give a classification of the CC ...

batch sizing in different planning period is categorized as a classical problem in production planning, that so many exact & heuristic methods have been proposed to solve this problem, each of which considering various aspects of the original problem. the solution obtained from majority – e.g. mrp – is in this format that there may be some periods of idleness or each period should produ...

This paper presents a novel method for the coordinated selection and positioning of groups of active-vision cameras for the autonomous surveillance of an object-of-interest as it travels through a multi-object workspace with an a priori unknown trajectory. Different approaches have been previously proposed to address the problem of sensor selection and control. However, these have primarily rel...

In contrast to typical planning problems, automated earthmoving operations such as digging a trench or leveling a mound of soil pose some additional challenges. First, soil is diffuse and therefore a unique description of the world requires a very large number of variables. Second, the interaction between the robot and the world is very complex to the point that it is not possible to accurately...