ParCeL-5/ParSSAP: A Parallel Programming Model and Library for Easy Development and Fast Execution of Simulations of Situated Multi-Agent Systems Stéphane Vialle [email protected]Eugen Dedu [email protected]Claude Timsit [email protected]SNPD’02 Charles Hermite Center (France) ERSIDP Supélec (France)
Charles Hermite Center (France). ERSIDP Supélec (France). ParCeL-5/ParSSAP: A Parallel Programming Model and Library for Easy Development and Fast Execution of Simulations of Situated Multi-Agent Systems. SNPD’02. Stéphane Vialle [email protected] - PowerPoint PPT Presentation
Welcome message from author
This document is posted to help you gain knowledge. Please leave a comment to let me know what you think about it! Share it to your friends and learn new things together.
Transcript
ParCeL-5/ParSSAP: A Parallel Programming Model and
Library for Easy Development and Fast Execution of Simulations of Situated
• Optimized parallel and sequential design of :• percept management• environment update
Classical
Specific and Optimized
11
3 - Parallelization: Wave Potential Field Propagation
Agent following an increasing potential pathAgent out potential field1
111
11
222
22
2 22
22 21
11
11
11
1
22
22
2
33
33
33
33
44
44 53
33
33
33
34
4 44
4
444
45
55
55
55
56
66
67
Potential field frontier
5 Medium source
7 Strong sourceObstacle
Potential propagation principles :
• Potentials emitted by resources (function of their features)• Spread, decrease, and bypass obstacles• Detected by agents (to avoid obstacles and reach resources)
• Fast and sufficient composition of potential fields (max( ) operator)
12
3 - Parallelization: Wave Potential Field PropagationParallelization :
• Automatic parallel use from agent behaviors
• Explicit parallel update:• Domain decomposition • Local propagation• Frontier sharing ; Re-propagation ; Until no change
• Several sequential algorithms Several complex combinations in parallel algorithm
Potentialfield
Potentialsource
Obstacle
P0slice
P1slice
FrontierComplex potential propagation
13
3 - Parallelization: Wave Potential Field Propagation
0
10
20
30
40
50
0 10 20 30 40 50Number of Processors
Spe
ed U
p vs
seq
. C Iterative & Recursive MixPure Iterative MethodS(P) = P
Ex : 1024x1024 boxes, 10000 resources, 0 obstacle, SGI-Origin2000
Breadth first recursive method: • most evolved, less efficiently implemented• re-propagation & numerous obstacles
Regular loop iterative method: • less evolved, most efficiently implemented• propagation re-propagation & numerous potential sources
02468
1012
0 2 4 6 8 10 12Number of Processors
Sp
ee
d U
p v
s s
eq
. C Iterative & Recursive Mix
Pure Iterative MethodS(P) = P
14
4 – Applications and Global Perfs
3 - Society of competitive selfish agents :Ishida – Yokoi – Kakazu, ECAL’99One agent : does nothing or cooperates = f(random, agent behaviors) How many cooperate ?
Same results than original simulationsCorrect situated MAS simulator
1 - Carrier robot simulation :1024 x 1024 boxes, 100 cycles10000 – 100000 agents Agents catch and carry some oresSearch efficient carrier population
S(32) = 15 (SGI)S(4) = 2.7 (SGI) – 3.5 (SUN)
Efficient parallel runs
% of cooperative agents
time
Stabilization phenomena
2 – Game of life (Conway) :Immobile agents …
Possible with ParCeL-5 !
15
5 - Conclusion and Future Works
Present results of ParCeL-5/ParSSAP:
• Good perfs : on high cost SGI-Origin2000: S(32) = 15 on small 4-processor SUN: S(4) = 3.5
• Allows quick developments of situated MAS
• Runs simulations with more than 100000 agents
• Open parallel programming model : vision, potential, …
In the future ….• Add direct communication between agents
• Add heuristic choice of wave propagation algorithms
• Continue to build large situated MAS for emergence search
• Optimize for low cost multiprocessor PC
16
ParCeL-5/ParSSAP: A Parallel Programming Model and
Library for Easy Development and Fast Execution of Simulations of Situated