Search results for "Multia"
showing 10 items of 159 documents
Calibrating a Motion Model Based on Reinforcement Learning for Pedestrian Simulation
2012
In this paper, the calibration of a framework based in Multi-agent Reinforcement Learning (RL) for generating motion simulations of pedestrian groups is presented. The framework sets a group of autonomous embodied agents that learn to control individually its instant velocity vector in scenarios with collisions and friction forces. The result of the process is a different learned motion controller for each agent. The calibration of both, the physical properties involved in the motion of our embodied agents and the corresponding dynamics, is an important issue for a realistic simulation. The physics engine used has been calibrated with values taken from real pedestrian dynamics. Two experime…
"Table 30" of "Tuning and test of fragmentation models based on identified particles and precision event shape data."
1996
Differential 3-jet rate for the JADE Algorithm. Corrected to final state particles. YCUT is the jet finding cutt-off parameter.
"Table 23" of "Measurement of event shape and inclusive distributions at s**(1/2) = 130-GeV and 136-GeV."
1997
2-jet rate for the Jade Algorithm.
"Table 28" of "Tuning and test of fragmentation models based on identified particles and precision event shape data."
1996
Differential 2-jet rate for the JADE Algorithm. Corrected to final state particles. YCUT is the jet finding cutt-off parameter.
Lazy consensus for networks with unknown but bounded disturbances
2007
We consider stationary consensus protocols for networks of dynamic agents. The measure of the neighbors' state is affected by Unknown But Bounded disturbances. Here the main contribution is the formulation and solution of what we call the isin-consensus problem, where the states are required to converge in a tube of ray isin asymptotically or in finite time.
"Table 25" of "Measurement of event shape and inclusive distributions at s**(1/2) = 130-GeV and 136-GeV."
1997
4-jet rate for the Jade Algorithm.
"Table 32" of "Tuning and test of fragmentation models based on identified particles and precision event shape data."
1996
Differential 4-jet rate for the JADE Algorithm. Corrected to final state particles. YCUT is the jet finding cutt-off parameter.
"Table 26" of "Measurement of event shape and inclusive distributions at s**(1/2) = 130-GeV and 136-GeV."
1997
5-jet rate for the Jade Algorithm.
Consensus for switched networks with unknown but bounded disturbances
2006
We consider stationary consensus protocols for networks of dynamic agents with switching topologies. The measure of the neighbors' state is affected by Unknown But Bounded disturbances. Here the main contribution is the formulation and solution of what we call the $\epsilon$-consensus problem, where the states are required to converge in a tube of ray $\epsilon$ asymptotically or in finite time.
A Similarity Evaluation Technique for Cooperative Problem Solving with a Group of Agents
1999
Evaluation of distance or similarity is very important in cooperative problem solving with a group of agents. Distance between problems is used by agents to recognize nearest solved problems for a new problem, distance between solutions is necessary to compare and evaluate the solutions made by different agents, and distance between agents is useful to evaluate weights of the agents to be able to integrate them by weighted voting. The goal of this paper is to develop a similarity evaluation technique to be used for cooperative problem solving with a group of agents. Virtual training environment used for this goal is represented by predicates that define relationships within three sets: prob…