Traffic grammar and algorithmic complexity in urban freeway flow patterns

DOI10.1007/S11067-007-9032-9MaRDI QIDQ2463768zbMATH OpenOpenAlexFDO

Authors Kingsley E. Haynes, Rajendra Kulkarni, Roger Stough

Publication date 17 December 2007

Published in Networks and Spatial Economics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11067-007-9032-9

zbMATH Keywords

Algorithmic complexityApproximate entropyFormal language theoryIntelligent transportation systems (ITS)

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Traffic problems in operations research (90B20) Models of societies, social and urban evolution (91D10)

Recommendations

• Recurrence quantification analysis as a tool for investigation of short-term traffic flow: application to Urban freeways
• Simulation and dynamics of freeway traffic
• Traffic-flow dynamics: A search for chaos
• Urban transportation network analysis from a thermodynamic perspective
• Maximum entropy approach in a traffic stream

Cites work

• A recipe for randomness
• Approximate entropy as a measure of system complexity.
• Approximate entropy: Statistical properties and applications
• scientific article; zbMATH DE number 43208 (Why is no real title available?)
• scientific article; zbMATH DE number 3639163 (Why is no real title available?)
• scientific article; zbMATH DE number 3205804 (Why is no real title available?)
• scientific article; zbMATH DE number 3255705 (Why is no real title available?)
• Logical basis for information theory and probability theory
• Not all (possibly) “random” sequences are created equal
• Randomness and degrees of irregularity.

Cited in

(1)

• Recurrence quantification analysis as a tool for investigation of short-term traffic flow: application to Urban freeways

This page was built for publication: Traffic grammar and algorithmic complexity in urban freeway flow patterns

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2463768)