In supply chain management manufacturing flow lines consist of two or more work areas, arranged in series and/or in parallel, with intermediate storage areas. The first work area processes raw items and the last work area produces end items or products, which are stored in a storage area in anticipation of future demand. Firstly managers should analyze and organize the long term production opti...

Multi-agent planning (MAP) is a major issue in the field of distributed AI. In the multi-agent environment, each agent must consider the constraints from other agents’ actions, when planning. It’s more complicated procedure than single agent planning. The research on Multi-agent planning attracts a lot of attention of researchers from different fields, including sociology, cognitive science, ec...

This work makes two contributions to geometric mo t ion planning f o r multiple robots: i ) mo t ion plans can be determined that simultaneously optimize a n independent performance criterzon f o r each robot; i i ) a general spectrum is defined between decoupled and centralized planning. B y considering independent performance criteria, we introduce a form of optimality that is consistent with...

We present a constraint programming-based solver for distributed planning and scheduling problems with a hierarchical objective function. The solver produces provably optimal centralized solutions. Preliminary computational results show the efficiency of our approach.

This article proposes a new approach for centralized path planning of multiple aircraft in presence of the obstacle-laden environment under low flying rules. The problem considers as a unified nonlinear constraint optimization problem. The minimum time and control investigate as the cost functions and the maximum velocity and power consider as the constraints. The pseudospectral method applies ...

We present a fully distributed multi-agent planning algorithm. Our methodology uses distributed constraint satisfaction to coordinate between agents, and local planning to ensure the consistency of these coordination points. To solve the distributed CSP efficiently, we must modify existing methods to take advantage of the structure of the underlying planning problem. In multi-agent planning dom...

Presented is a new approach to multi-robot motion planning that is based on the concept of planning within dynamic robot networks. The system enables multiple mobile robots that have limited ranges of sensing and communication to maneuver safely in dynamic, unstructured environments. As the robots move about their workspace, localized robot groups form networks within which world models can be ...

Supply chains are networks of independent companies in a dynamic environment. The goal of supply chain management is the coordination of these companies in dynamic environment. This research addresses the decentralized coordination of independent operations planning in order to achieve near-optimal solution. Using a heuristic search with local optimization we coordinate two partners of a supply...

Leading Enterprise Resource Planning (ERP) vendors are offering new tools and solutions allowing co-ordination through centralized planning and control of the overall Supply Chain (SC); yet there are many SCs made up of Small and Medium Enterprises (SMEs) in which such an approach is not viable, since the components of the chain are not willing to give up their planning autonomy for co-ordinati...

Monitoring and control of observed space in a security zone equipped with multi cameras and security robots are essential for efficient invader detection. For controlling the observed space, a coordinated motion planning technique is essential when a centralized motion planning solution is realized by a single supervisory system. This technique, however, is known to be very difficult to realize...