capstone-project

KO | EN

gitlite — search

#python #react #ai #llm #go #docker #macos #nodejs #java #kubernetes #awesome-list #pytorch #security #open-source

capstone-project

(★ 9)

Implementation of Deep Deterministic Policy Gradient (DDPG) method on autonomous vehicle within the highway-env

capstone-project 최신버젼 다운로드

최종 버전 다운로드 (.zip)

// repository documentation

Was this content helpful?

★ 0 (0 ratings)

# Implementation of Deep Deterministic Policy Gradient (DDPG) Method on Autonomous Vehicle within the Highway-env

*This is a collaboration with Nattapol Hirattanapan, Zelin Zheng, Vivian Ying Ying Tong, Ma Kristin Ysabel Dela Cruz, and Ziming Fang for the Data Science Capstone Project in S1 2023 at the University of Sydney, Australia.*

This project is an implementation of an autonomous highway driving algorithm based on the framework of Deep Deterministic Policy Gradient (DDPG). The agent is trained under an environment simulated by the highway-env package [[1]](#1) in gynasium and learns to avoid collisions through iterative learning meanwhile maintain realistic human driving behaviors.

<img src="https://github.com/3grasses/capstone-project/assets/146526540/f84ef758-4363-469b-8a21-ea29e2d83d21">
 
 Learning outcome of the proposed DDPG algorithm.

DDPG is a deep reinforcement learning algorithm that combines the essence of Deep Q-Network (DQN) and Deterministic Policy Gradient (DPG). It preserves the features of experience replay buffer and separate target networks in DQN to stabilize training process and reduce data correlation. However, unlike DQN which maps the Q-value function solely, DDPG uses an Actor-Critic network to learn the Q-value function and the policy concurrently to deal with the continuous action space. More detailed explanations of the theoretical background of this are provided in `DDPG-workflow.pdf` in case of your interest. In addition, the adoption of the deterministic policy in DDPG allows it to reuse previous experience to update the networks and accelerate the learning if a continuous action space is used, which is an advantage over the stochastic policy used in other Actor-Critic methods like Advantage Actor Critic (A2C). In this project, the DDPG method is explored due to the choice of continuous action space.

Compared to previous studies, the significance of this project includes:

- Use continuous action space to simulate real-world environment and enhance its potential for future applications.
- Apply DDPG method to autonomous driving and optimize it on reward gain.
- Introduce the concept of social awareness to make the agent adhere to realistic human driving behaviors or real-world traffic regulations, such as adhering to safe stopping distance or speed limits.

Note that the code provided here is already the version after optimization, and it is proved to outperform the A2C model in `stable-baselines` by more than 500% in terms of average test reward.

## Content

- **main.py**: The training and evaluation procedure of the algorithm.
- **ddpg.py**: The main structure of the DDPG algorithm.
- **networks.py**: The Actor and Critic networks applied in the DDPG algorithm.
- **noise.py**: The action noise used to enhance the agent's exploration
- **utils.py**: The evaluation method and other auxiliary functions, e.g., plotting.

## Settings

#### Environment
A continuous action space which provides the choices of acceleration and steering angle is adopted. However, the range of steering range is confined to [-30, 30] degree based on the real-world scenario. Values of other elements, such as lane number or traffic density, are directly defined using the environment configuration provided by the `highway-env` and can be found in `main.py`.

#### Reward function
Due to the choice of the continuous action space, different strategies are applied to prevent the agent from spinning, moving backward, or taking other unexpected actions and encourage it to adhere to the real-world regulations and driving behaviors as mentioned above.

#### Training
The entire training takes 3,000 epochs with 300 maximum steps in each epoch to prevent overload. The networks are updated every step once the experience replay buffer, which has a size of 25000, is full. The type of exploration noise and learning rate scheduler are determined based on the optimization result, and the choices of the relevant parameters are stated in `ddpg.py`.
 
#### Evaluation
Mean of average test reward is used to evaluate the model performance in this project. It is calculated by taking the mean of the average reward obtained under each epoch for 30 runs. Note that the maximum step in each epoch is extended to 500 during evaluation in order to obtain a more generalized result.

## Reference

<a id="1">[1]</a> Edouard Leurent. An Environment for Autonomous Driving Decision-Making. *GitHub.* https://github.com/eleurent/highway-env

capstone-project

capstone-project 최신버젼 다운로드

오늘의 추천 프로젝트

Was this content helpful?

Recent Feedback

capstone-project

capstone-project 최신버젼 다운로드

오늘의 추천 프로젝트

Was this content helpful?

Recent Feedback

Download README