By Topic

Control Mechanism Analysis of Small-Agent Networks Using a Distinguished Node Model for Urban Traffic Controls

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)

This paper presents a new control mechanism based on a novel distinguished node (DN) model, for network topology and analysis in small-agent networks such as urban traffic network. The proposed DN model is represented by an extended direct graph that contains congregation and dispersing nodes, and main and connecting links. Both static and dynamic properties of the DN model are analyzed. With this new network model, a control mechanism is developed, which is governed by two heuristic rules of conflict avoidance and total delay minimization. A case study on a real urban traffic network is performed to demonstrate feasibility of the proposed DN model applied to the empirical networks, and verify the effectiveness of the proposed control mechanism.

Published in:

Automation Science and Engineering, IEEE Transactions on  (Volume:5 ,  Issue: 3 )