However, these concepts do not cover exceptional conditions, unforeseen properties of cases, and conflicting requirements that call for adaptations of prespecified work-allocation decisions. We assume that contradictory and continuously changing requirements of work allocation should not be solved by automatic rule evaluation and centralized planning approaches. From our point of view it is mor...

The typical planning, design or operations problem has multiple objectives and constraints. Such problems can be solved using only autonomous agents, each specializing in a small and distinct subset of the overall objectives and constraints. No centralized control is necessary. Instead, agents collaborate by observing and modifying one another’s work. Convergence to good solutions for a variety...

This paper shall summarize the hardware and sofrware description of the overall system in short terms. Our robot was designed move as fast as possible keeping correctness. So, DSP CPU, high pulse encoder and Adaptive Control algorithm was used at the robot system. From the information of global vision system, centralized computer excutes overall game strategy and decides each robot’s movement. ...

Virtual enterprises and virtual supply chain concepts have been presented to propose solution for a seamless integration and data exchange between enterprises in the supply chain. Cloud computing technology enables centralized data storage and processing for operations and supply chain. This paper presents a prototype implementation of cloud-based virtual supply chain. The proposed solution off...

This paper presents an offline collision-free path planning algorithm for multiple mobile robots using a 2D spatial-time map. In this decoupled approach, a centralized planner uses a SpatioTemporal A* algorithm to find the lowest time cost path for each robot in a sequentially order based on its assigned priority. Improvements in viable path solutions using wait time insertion and adaptive prio...

Decentralized partially-observable Markov decision processes (Dec-POMDPs) are a powerful tool for modeling multi-agent planning and decision-making under uncertainty. Prevalent Dec-POMDP solution techniques require centralized computation given full knowledge of the underlying model. But in real world scenarios, model parameters may not be known a priori, or may be difficult to specify. We prop...

A DD/D is a centralized repository of information about data descriptions such as meaning, relationships to other data, responsibility, origin, usage, and format. It is a basic tool within the database environment that assists company management, data-base administrators, systems analysts, and application programmers in effectively planning, controlling, and evaluating the collection, storage, ...

We study the multi-agent path finding problem (MAPF) for a group of agents which are allowed to move into arbitrary directions on a 2D square grid. We focus on centralized conflict resolution for independently computed plans. We propose an algorithm that eliminates conflicts by using local re-planning and introducing time offsets to the execution of paths by different agents. Experimental resul...

We discuss six labs that present two contrasting approaches to AI robotics. The first four labs present the traditional, representation-based approach to designing behavior control algorithms for autonomous robots. Robots use an internal representation of the world plus a planning algorithm to guide behavior. The second two labs present a behaviorbased or reactive approach to managing robot beh...