Modeling of Distribution Service Network System in Comprehensive Passenger Transportation Hub

2012 ◽  
Vol 253-255 ◽  
pp. 1195-1200
Author(s):  
Zhe Zhang ◽  
Chang Xu Ji ◽  
Mao Jing Jin ◽  
Qian Li ◽  
Lifen Yun ◽  
...  

Distribution service network system (DSNS) has dynamic, open, pop and other nonlinear characteristics in terms of structure, environment, and behavior as a subsystem of comprehensive passenger transportation hub system (CPTH). It is a typical complex system. The author putted forward the adaptability of DSNS based on the analysis of complexity of DSNS and analyzed the driving force of adaptability. The model of individual agent and self-adaptive control model of DSNS were designed to provide a dynamic method for adjusting control strategy based on multi-Agent method and CAS theory.

Author(s):  
Aadesh Neupane ◽  
Michael Goodrich

Algorithms used in networking, operation research and optimization can be created using bio-inspired swarm behaviors, but it is difficult to mimic swarm behaviors that generalize through diverse environments. State-machine-based artificial collective behaviors evolved by standard Grammatical Evolution (GE) provide promise for general swarm behaviors but may not scale to large problems. This paper introduces an algorithm that evolves problem-specific swarm behaviors by combining multi-agent grammatical evolution and Behavior Trees (BTs). We present a BT-based BNF grammar, supported by different fitness function types, which overcomes some of the limitations in using GEs to evolve swarm behavior. Given human-provided, problem-specific fitness-functions, the learned BT programs encode individual agent behaviors that produce desired swarm behaviors. We empirically verify the algorithm's effectiveness on three different problems: single-source foraging, collective transport, and nest maintenance. Agent diversity is key for the evolved behaviors to outperform hand-coded solutions in each task.


1979 ◽  
Vol 24 (10) ◽  
pp. 879-879
Author(s):  
KARL E. WEICK

Author(s):  
Javier Ortuño-Sierra ◽  
Beatriz Lucas-Molina ◽  
Félix Inchausti ◽  
Eduardo Fonseca-Pedrero

Psychological problems in children and adolescent populations range from 10% to 20% [...]


Author(s):  
D. H. A. Maithripala ◽  
D. H. S. Maithripala ◽  
S. Jayasuriya

We propose a framework for synthesizing real-time trajectories for a wide class of coordinating multi-agent systems. The class of problems considered is characterized by the ability to decompose a given formation objective into an equivalent set of lower dimensional problems. These include the so called radar deception problem and the formation control problems that fall under formation keeping and/or formation reconfiguration tasks. The decomposition makes the approach scalable, computationally economical, and decentralized. Most importantly, the designed trajectories are dynamically feasible, meaning that they maintain the formation while satisfying the nonholonomic and saturation type velocity and acceleration constraints of each individual agent. The main contributions of this paper are (i) explicit consideration of second order dynamics for agents, (ii) explicit consideration of nonholonomic and saturation type velocity and acceleration constraints, (iii) unification of a wide class of formation control problems, and (iv) development of a real-time, distributed, scalable, computationally economical motion planning algorithm.


Sign in / Sign up

Export Citation Format

Share Document