Control Problems for Conservation Laws with Traffic Applications

Modeling, Analysis, and Numerical Methods

By: Alexandre Bayen, Paola Goatin, Mauro Garavello, Maria Laura Delle Monache, Benedetto Piccoli

Write A Review

Paperback | 24 April 2022

At a Glance

Paperback
248 Pages

Dimensions(cm)
15.5 x 23.4 x 1.8

Paperback

RRP $64.56

$63.99

or 4 interest-free payments of $16.00 with

or

Ships in 15 to 25 business days

Conservation and balance laws on networks have been the subject of much research interest given their wide range of applications to real-world processes, particularly traffic flow. This open access monograph is the first to investigate different types of control problems for conservation laws that arise in the modeling of vehicular traffic. Four types of control problems are discussed - boundary, decentralized, distributed, and Lagrangian control - corresponding to, respectively, entrance points and tolls, traffic signals at junctions, variable speed limits, and the use of autonomy and communication. Because conservation laws are strictly connected to Hamilton-Jacobi equations, control of the latter is also considered. An appendix reviewing the general theory of initial-boundary value problems for balance laws is included, as well as an appendix illustrating the main concepts in the theory of conservation laws on networks.

Industry Reviews

"This book provides comprehensive and self-contained descriptions and analysis of such problems and can be used for a one semester course at graduate or advanced undergraduate level." (Giuseppe Maria Coclite, Mathematical Reviews, April, 2024)

Shipping

	Standard Shipping	Express Shipping
Metro postcodes:	$9.99	$14.95
Regional postcodes:	$9.99	$14.95
Rural postcodes:	$9.99	$14.95

Orders over $79.00 qualify for free shipping.

How to return your order

At Booktopia, we offer hassle-free returns in accordance with our returns policy. If you wish to return an item, please get in touch with Booktopia Customer Care.

Additional postage charges may be applicable.