DCCS:A General-Purpose Distributed Cryptographic Computing System

Distributed cryptographic computing system plays an important role since cryptographic computing is extremely computation sensitive. However, no general cryptographic computing system is available. Grid technology can give an efficient computational support for cryptographic applications. Therefore, a general-purpose grid-based distributed computing system called DCCS is put forward in this paper. The architecture of DCCS is simply described at first. The policy of task division adapted in DCCS is then presented. The method to manage subtask is further discussed in detail. Furthermore, the building and execution process of a computing job is revealed. Finally, the details of DCCS implementation under Globus Toolkit 4 are illustrated.

Extending HTN to planning and execution control for small combat unit simulation

Modeling how military commanders carry out operations is considered complicated,requiring the capability of not only planning for multiple subordinates but also responding to unexpected events during execution.This paper presents an Hierarchical Task Network(HTN)embedded planning and execution control architecture for small unit commander agents.To be adaptive to dynamic world state changes,the architecture employs a partial planning mechanism and generates actions only applicable to current situations.It is also able to coordinate subordinates’actions and handle execution failures at runtime.We demonstrate the architecture’s use with an infantry company scenario,where the commander orders three platoons assaulting a defined hill.Our approach shows the effectiveness to control multiple entities in dynamic environments,making the architecture well-suited to represent small unit commanders’behavior.

Coordinating control of multiple rigid bodies based on motion primitives

This paper studies the problem of coordinated motion generation for a group of rigid bodies. Two classes of coordinated motion primitives, relative equilibria and ma- neuvers, are given as building blocks for generating coordi- nated motions. In a motion-primitive based planning frame- work, a control method is proposed for the robust execution of a coordinated motion plan in the presence of perturba- tions. The control method combines the relative equilibria stabilization with maneuver design, and results in a close- loop motion planning framework. The performance of the control method has been illustrated through a numerical sim- ulation.

Planning to Plan-Integrating Control Flow

In many planning situations, computation itself becomes a resource to be planned and scheduled. We model such computational resources as conventional resources which are used by control-flow actions, e.g., to direct the planning process. Control-flow actions and conventional actions are planned/scheduled in an integrated way and can interact with each other. Control-flow actions are then executed by the planning engine itself. The approach is illustrated by examples, e.g., for hierarchical planning, in which tasks that are temporally still far away impose only rough constraints on the current schedule, and control-flow tasks ensure that these tasks are refined as they approach the current time. Using the same mechanism, anytime algorithms can change appropriate search methods or parameters over time, and problems like scheduling critical time-outs for garbage collection can be made part of the planning itself.