### Abstract

This paper develops an adaptive, optimal planning algorithm for signal control at a single intersection using an efficient dynamic programming technique. It is called ADPAS (Adaptive Dynamic Programming Algorithm for Signaling). The objective of ADPAS is to minimize the total delay experienced by vehicles passing through an intersection. ADPAS can generate any sequence of green phases to optimize signal control without restriction to fixed cycles of green phases. The algorithm employs reaching as the method to solve the forward DP functional equation, which does not require any prior knowledge of the states of the DP network. The efficiency of the algorithm results from two acceleration techniques that adaptively eliminate inferior states as the algorithm progresses. We verify computational efficiency of ADPAS with several test cases.

Original language | English |
---|---|

Pages (from-to) | 148-160 |

Number of pages | 13 |

Journal | Lecture Notes in Computer Science |

Volume | 3483 |

Issue number | IV |

Publication status | Published - 2005 Sep 26 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Theoretical Computer Science
- Computer Science(all)

### Cite this

*Lecture Notes in Computer Science*,

*3483*(IV), 148-160.

}

*Lecture Notes in Computer Science*, vol. 3483, no. IV, pp. 148-160.

**Optimal signal control using adaptive dynamic programming.** / Kim, Chang Ouk; Park, Yunsun; Baek, Jun Geol.

Research output: Contribution to journal › Conference article

TY - JOUR

T1 - Optimal signal control using adaptive dynamic programming

AU - Kim, Chang Ouk

AU - Park, Yunsun

AU - Baek, Jun Geol

PY - 2005/9/26

Y1 - 2005/9/26

N2 - This paper develops an adaptive, optimal planning algorithm for signal control at a single intersection using an efficient dynamic programming technique. It is called ADPAS (Adaptive Dynamic Programming Algorithm for Signaling). The objective of ADPAS is to minimize the total delay experienced by vehicles passing through an intersection. ADPAS can generate any sequence of green phases to optimize signal control without restriction to fixed cycles of green phases. The algorithm employs reaching as the method to solve the forward DP functional equation, which does not require any prior knowledge of the states of the DP network. The efficiency of the algorithm results from two acceleration techniques that adaptively eliminate inferior states as the algorithm progresses. We verify computational efficiency of ADPAS with several test cases.

AB - This paper develops an adaptive, optimal planning algorithm for signal control at a single intersection using an efficient dynamic programming technique. It is called ADPAS (Adaptive Dynamic Programming Algorithm for Signaling). The objective of ADPAS is to minimize the total delay experienced by vehicles passing through an intersection. ADPAS can generate any sequence of green phases to optimize signal control without restriction to fixed cycles of green phases. The algorithm employs reaching as the method to solve the forward DP functional equation, which does not require any prior knowledge of the states of the DP network. The efficiency of the algorithm results from two acceleration techniques that adaptively eliminate inferior states as the algorithm progresses. We verify computational efficiency of ADPAS with several test cases.

UR - http://www.scopus.com/inward/record.url?scp=24944580093&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=24944580093&partnerID=8YFLogxK

M3 - Conference article

AN - SCOPUS:24944580093

VL - 3483

SP - 148

EP - 160

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

SN - 0302-9743

IS - IV

ER -