DP-Q(λ): Real-time Path Planning for Multi-agent in Large-scale Web3D Scene

Authors

Fengting Yan, School of Software Engineering, Shanghai 201804, China;
Jinyuan Jia, School of Software Engineering, Shanghai 201804, China;

Abstract

Abstract: The path planning of multi-agent in an unknown large-scale scene needs an efficient and stable algorithm, and needs to solve multi-agent collision avoidance problem, and then completes a real-time path planning in Web3D. To solve above problems, the DP-Q(λ) algorithm is proposed; and the direction constraints, high reward or punishment weight training methods are used to adjust the values of reward or punishment by using a probability p (0-1 random number). The value from reward or punishment determines its next step path planning strategy. If the next position is free, the agent could walk to it. The above strategy is extended to multi-agent path planning, and is used in Web3D. The experiment shows that the DP-Q(λ) algorithm is efficient and stable in the Web3D real-time multi-agent path planning.

Recommended Citation

Yan, Fengting and Jia, Jinyuan (2019) "DP-Q(λ): Real-time Path Planning for Multi-agent in Large-scale Web3D Scene," Journal of System Simulation: Vol. 31: Iss. 1, Article 3.
DOI: 10.16182/j.issn1004731x.joss.16PQS-003
Available at: https://dc-china-simulation.researchcommons.org/journal/vol31/iss1/3

First Page

16

Revised Date

2016-08-04

DOI Link

https://doi.org/10.16182/j.issn1004731x.joss.16PQS-003

Last Page

26

CLC

TP391

Recommended Citation

Yan Fengting, Jia Jinyuan. DP-Q(λ): Real-time Path Planning for Multi-agent in Large-scale Web3D Scene[J]. Journal of System Simulation, 2019, 31(1): 16-26.

DOI

10.16182/j.issn1004731x.joss.16PQS-003