Search arXivSearch

arXiv · 1705.05251

A pedestrian hopping model and traffic light scheduling for pedestrian-vehicle mixed-flow networks

Abstract

This paper presents a pedestrian hopping model and a traffic signal scheduling strategy with consideration of both pedestrians and vehicles in the urban traffic system. Firstly, a novel mathematical model consisting of several logic constraints is proposed to describe the pedestrian flow in the urban traffic network and its dynamics are captured by the hopping rule, which depicts the changing capacity of each time interval from one waiting zone to another. Based on the hopping mechanism, the pedestrian traffic light scheduling problems are formulated by two different performance standards: pedestrian delay and pedestrian unhappiness. Then the mathematical technique and the meta-heuristic approach are both adopted to solve the scheduling problem: Mixed integer linear programming (MILP) formulation for pedestrian delay model and discrete harmony search algorithm (DHS) for both pedestrian delay model and unhappiness model. Secondly, a mathematical model about the vehicle traffic network, which captures drivers psychological responses to the traffic light signals, is introduced. Thirdly, a traffic light scheduling strategy to minimize the trade-off of the delays between pedestrians and vehicles is proposed. Finally, we translate this traffic signal scheduling problem for both pedestrians and vehicles into a MILP problem which can be solved by several existing tools, e.g., GUROBI. Numerical simulation results are provided to illustrate the effectiveness of our real-time traffic light scheduling for pedestrian movement and the potential impact to the vehicle traffic flows by the pedestrian movement.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yi Zhang, Rong Su, Kaizhou Gao, Yicheng Zhang. 2017-05-15. A pedestrian hopping model and traffic light scheduling for pedestrian-vehicle mixed-flow networks. https://arxiv.org/abs/1705.05251

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Strategic Inference in Stackelberg Games: Optimal Control for Revealing Adversary Intent

We study a continuous-time stochastic Stackelberg game in which a leader seeks to accomplish a primary objective while inferring a hidden parameter of a rational follower. The follower solves an entropy-regularized linear-quadratic tracking problem and responds to the leader's trajectory with a randomized policy. Anticipating this response, the leader designs informative controls to maximize the estimation efficiency for the follower's latent intent, through maximum likelihood estimation. Unlike prior work on discrete-time or finite-candidate inverse learning, our framework enables continuous parameter inference without prior assumptions and endogenizes the information source through the follower's strategic feedback. We derive semi-explicit solutions, prove well-posedness, and develop recurrent neural network algorithms to approximate the leader's path-dependent control. Numerical experiments demonstrate how the leader balances task performance and information gain, highlighting the practical value of our approach for adversarial strategic inference.

math.OC

Stratification for Nonlinear Semidefinite Programming

This paper introduces a stratification framework for nonlinear semidefinite programming (NLSDP) that reveals and utilizes the geometry behind the nonsmooth KKT system. Based on the index stratification of $\mathbb{S}^n$ and its lift to the primal-dual space, a stratified variational analysis is developed. Specifically, we define the stratum-restricted regularity property, characterize it by the verifiable weak second order condition (W-SOC) and weak strict Robinson constraint qualification (W-SRCQ), and interpret the W-SRCQ geometrically via transversality, with stability along strata. The interactions of these properties across neighboring strata are further examined, leading to the conclusion that classical strong-form regularity conditions correspond to the local uniform validity of stratum-restricted counterparts. On the algorithmic side, a stratified Gauss--Newton method with normal steps and a correction mechanism is proposed for globally solving the KKT equation through a least-squares merit function. We demonstrate that the algorithm converges globally to directional stationary points. Moreover, under the second order sufficient condition (SOSC) and the strict Robinson constraint qualification (SRCQ) at an accumulation point, with a suitable correction threshold, the whole sequence converges superlinearly to this point, which is a KKT pair, and eventually identifies the active stratum. The rate is quadratic if the problem data are additionally of class $LC^2$ near the solution.

math.OC

Convergence Rate Analysis of SOAP with Arbitrary Orthogonal Projection Matrices

In this short note, we establish, for the first time, the convergence rate of SOAP, an efficient and popular matrix-based optimizer for training deep neural networks. Our analysis extends to a more general variant of SOAP that admits arbitrary orthogonal projection matrices and requires only that these matrices be conditionally independent of the current stochastic gradient at each iteration. For example, they may be constructed from information available up to the preceding step.

math.OC