The plane system of coordinates for highway surveys; a review of a ground surveying method, prepared under the direction of W.M. Parker, engineer of traffic & planning, and C.E. Gray, assistant engineer of planning, by Jon S. Beazley, photogrammetric engineer.

Bibliography: leaves 46-48.

Sensor Planning for Bayesian Nonparametric Target Modeling

Bayesian nonparametric models, such as the Gaussian process and the Dirichlet process, have been extensively applied for target kinematics modeling in various applications including environmental monitoring, traffic planning, endangered species tracking, dynamic scene analysis, autonomous robot navigation, and human motion modeling. As shown by these successful applications, Bayesian nonparametric models are able to adjust their complexities adaptively from data as necessary, and are resistant to overfitting or underfitting. However, most existing works assume that the sensor measurements used to learn the Bayesian nonparametric target kinematics models are obtained a priori or that the target kinematics can be measured by the sensor at any given time throughout the task. Little work has been done for controlling the sensor with bounded field of view to obtain measurements of mobile targets that are most informative for reducing the uncertainty of the Bayesian nonparametric models. To present the systematic sensor planning approach to leaning Bayesian nonparametric models, the Gaussian process target kinematics model is introduced at first, which is capable of describing time-invariant spatial phenomena, such as ocean currents, temperature distributions and wind velocity fields. The Dirichlet process-Gaussian process target kinematics model is subsequently discussed for modeling mixture of mobile targets, such as pedestrian motion patterns.

Novel information theoretic functions are developed for these introduced Bayesian nonparametric target kinematics models to represent the expected utility of measurements as a function of sensor control inputs and random environmental variables. A Gaussian process expected Kullback Leibler divergence is developed as the expectation of the KL divergence between the current (prior) and posterior Gaussian process target kinematics models with respect to the future measurements. Then, this approach is extended to develop a new information value function that can be used to estimate target kinematics described by a Dirichlet process-Gaussian process mixture model. A theorem is proposed that shows the novel information theoretic functions are bounded. Based on this theorem, efficient estimators of the new information theoretic functions are designed, which are proved to be unbiased with the variance of the resultant approximation error decreasing linearly as the number of samples increases. Computational complexities for optimizing the novel information theoretic functions under sensor dynamics constraints are studied, and are proved to be NP-hard. A cumulative lower bound is then proposed to reduce the computational complexity to polynomial time.

Three sensor planning algorithms are developed according to the assumptions on the target kinematics and the sensor dynamics. For problems where the control space of the sensor is discrete, a greedy algorithm is proposed. The efficiency of the greedy algorithm is demonstrated by a numerical experiment with data of ocean currents obtained by moored buoys. A sweep line algorithm is developed for applications where the sensor control space is continuous and unconstrained. Synthetic simulations as well as physical experiments with ground robots and a surveillance camera are conducted to evaluate the performance of the sweep line algorithm. Moreover, a lexicographic algorithm is designed based on the cumulative lower bound of the novel information theoretic functions, for the scenario where the sensor dynamics are constrained. Numerical experiments with real data collected from indoor pedestrians by a commercial pan-tilt camera are performed to examine the lexicographic algorithm. Results from both the numerical simulations and the physical experiments show that the three sensor planning algorithms proposed in this dissertation based on the novel information theoretic functions are superior at learning the target kinematics with

little or no prior knowledge

Verkehrsmonitoring mit Hilfe von Radarfernerkundung

Für die Zukunft wird eine Zunahme an Verkehr prognostiziert, gleichzeitig herrscht ein Mangel an Raum und finanziellen Mitteln, um weitere Straßen zu bauen. Daher müssen die vorhandenen Kapazitäten durch eine bessere Verkehrssteuerung sinnvoller genutzt werden, z.B. durch Verkehrsleitsysteme. Dafür werden räumlich aufgelöste, d.h. den Verkehr in seiner flächenhaften Verteilung wiedergebende Daten benötigt, die jedoch fehlen. Bisher konnten Verkehrsdaten nur dort erhoben werden, wo sich örtlich feste Meßeinrichtungen befinden, jedoch können damit die fehlenden Daten nicht erhoben werden. Mit Fernerkundungssystemen ergibt sich die Möglichkeit, diese Daten flächendeckend mit einem Blick von oben zu erfassen. Nach jahrzehntelangen Erfahrungen mit Fernerkundungsmethoden zur Erfassung und Untersuchung der verschiedensten Phänomene auf der Erdoberfläche wird nun diese Methodik im Rahmen eines Pilotprojektes auf den Themenbereich Verkehr angewendet. Seit Ende der 1990er Jahre wurde mit flugzeuggetragenen optischen und Infrarot-Aufnahmesystemen Verkehr beobachtet. Doch bei schlechten Wetterbedingungen und insbesondere bei Bewölkung, sind keine brauchbaren Aufnahmen möglich. Mit einem abbildenden Radarverfahren werden Daten unabhängig von Wetter- und Tageslichtbedingungen oder Bewölkung erhoben. Im Rahmen dieser Arbeit wird untersucht, inwieweit mit Hilfe von flugzeuggetragenem synthetischem Apertur Radar (SAR) Verkehrsdaten aufgenommen, verarbeitet und sinnvoll angewendet werden können. Nicht nur wird die neue Technik der Along-Track Interferometrie (ATI) und die Prozessierung und Verarbeitung der aufgenommenen Verkehrsdaten ausführlich dargelegt, es wird darüberhinaus ein mit dieser Methodik erstellter Datensatz mit einer Verkehrssimulation verglichen und bewertet. Abschließend wird ein Ausblick auf zukünftige Entwicklungen der Radarfernerkundung zur Verkehrsdatenerfassung gegeben.

Metric Training for the Transportation Industry Module IV - Transportation Planning and Traffic Monitoring, HR-376

"Metric Training For The Highway Industry", HR-376 was designed to produce training materials for the various divisions of the Iowa DOT, local government and the highway construction industry. The project materials were to be used to introduce the highway industry in Iowa to metric measurements in their daily activities. Five modules were developed and used in training over 1,000 DOT, county, city, consultant and contractor staff in the use of metric measurements. The training modules developed deal with the planning through operation areas of highway transportation. The materials and selection of modules were developed with the aid of an advisory personnel from the highway industry. Each module is design as a four hour block of instruction and a stand along module for specific types of personnel. Each module is subdivided into four chapters with chapter one and four covering general topics common to all subjects. Chapters two and three are aimed at hands on experience for a specific group and subject. This module includes: Module 4 - Transportation Planning and Traffic Monitoring. Hands on examples of applications of metric measurements in the development of planning reports and traffic data collection are included in this module.

Multi-level planning for semi-autonomous vehicles in traffic scenarios based on separation maximization

The planning of semi-autonomous vehicles in traffic scenarios is a relatively new problem that contributes towards the goal of making road travel by vehicles free of human drivers. An algorithm needs to ensure optimal real time planning of multiple vehicles (moving in either direction along a road), in the presence of a complex obstacle network. Unlike other approaches, here we assume that speed lanes are not present and that different lanes do not need to be maintained for inbound and outbound traffic. Our basic hypothesis is to carry forward the planning task to ensure that a sufficient distance is maintained by each vehicle from all other vehicles, obstacles and road boundaries. We present here a 4-layer planning algorithm that consists of road selection (for selecting the individual roads of traversal to reach the goal), pathway selection (a strategy to avoid and/or overtake obstacles, road diversions and other blockages), pathway distribution (to select the position of a vehicle at every instance of time in a pathway), and trajectory generation (for generating a curve, smooth enough, to allow for the maximum possible speed). Cooperation between vehicles is handled separately at the different levels, the aim being to maximize the separation between vehicles. Simulated results exhibit behaviours of smooth, efficient and safe driving of vehicles in multiple scenarios; along with typical vehicle behaviours including following and overtaking.

Port planning in Latin America and the evolution of container traffic with Asia-Pacific

This edition of the FAL Bulletin addr esses port planning in Latin America and delivers an initial forecast on container traffic between Latin America and Asia- Pacific through 2015. This bulletin also summarizes the principal conclusions of the Expert Workshop organized by the Unit of Infrastructure Services, in conjunction with ESCAP and the Korea Maritime Institute (KMI) in October 2009, in Panama.

Planning and scheduling work zone traffic control - technical report. Final report.

Federal Highway Administration, Office of Research, Washington, D.C.

Linkage of the 1999-2008 National Health and Nutrition Examination Surveys to traffic indicators from the National Highway Planning Network /

Mode of access: Internet.

Planning and scheduling work zone traffic control. Executive summary.

Federal Highway Administration, Office of Research, Washington, D.C.

Planning and scheduling work zone traffic control. Final technical report.

Federal Highway Administration, Office of Research, Washington, D.C.

Planning and scheduling work zone traffic control. User's guide.

Federal Highway Administration, Office of Research, Washington, D.C.

Selective traffic enforcement program; planning guide. Revised.

Mode of access: Internet.

Highway study [a research study of traffic patterns and highway needs for 1960 and 1980-85, Eugene-Springfield area] In cooperation with the Central Lane Planning Council and others. Donald N. Johnson, project director.

Fold. plan in pocket.

Tiering strategic environmental assessment and project environmental impact assessment in highway planning in Sao Paulo, Brazil

Constructing highways in dense urban areas is always a challenge. In Sao Paulo Metropolitan Region, heavy truck traffic contributes to clog streets and expressways alike. As part of the traffic neither originates nor head to the region, a peripheral highway has been proposed to reduce traffic problems. This project called Rodoanel, is an expressway approximately 175 km long. The fact that the projected south and north sections would cross catchments that supply most of the metropolis water demand was strongly disputed and made the environmental permitting process particularly difficult. The agency in charge commissioned a strategic environmental assessment (SEA) of a revamped project, and called it the Rodoanel Programme. However, the SEA report failed to satisfactorily take account of significant strategic issues. Among these, the highway potential effect of inducing urban sprawl over water protection zones is the most critical issue, as it emerged later as a hurdle to project licensing. Conclusion is that, particularly where no agreed-upon framework for SEA exists, when vertical tiering with downstream project EIA is sought, then a careful scoping of strategic issues is more than necessary. If an agreement on `what is strategic` is not reached and not recognized by influential stakeholders, then the unsettled conflicts will be transferred to project EIA. In such a context, SEA will have added another loop to the usually long road to project approval. (c) 2008 Elsevier Inc. All rights reserved.

Planning and verification of multipath routing protocols

Conventionally the problem of the best path in a network refers to the shortest path problem. However, for the vast majority of networks present nowadays this solution has some limitations which directly affect their proper functioning, as well as an inefficient use of their potentialities. Problems at the level of large networks where graphs of high complexity are commonly present as well as the appearing of new services and their respective requirements, are intrinsically related to the inability of this solution. In order to overcome the needs present in these networks, a new approach to the problem of the best path must be explored. One solution that has aroused more interest in the scientific community considers the use of multiple paths between two network nodes, where they can all now be considered as the best path between those nodes. Therefore, the routing will be discontinued only by minimizing one metric, where only one path between nodes is chosen, and shall be made by the selection of one of many paths, thereby allowing the use of a greater diversity of the present paths (obviously, if the network consents). The establishment of multi-path routing in a given network has several advantages for its operation. Its use may well improve the distribution of network traffic, improve recovery time to failure, or it can still offer a greater control of the network by its administrator. These factors still have greater relevance when networks have large dimensions, as well as when their constitution is of high complexity, such as the Internet, where multiple networks managed by different entities are interconnected. A large part of the growing need to use multipath protocols is associated to the routing made based on policies. Therefore, paths with different characteristics can be considered with equal level of preference, and thus be part of the solution for the best way problem. To perform multi-path routing using protocols based only on the destination address has some limitations but it is possible. Concepts of graph theory of algebraic structures can be used to describe how the routes are calculated and classified, enabling to model the routing problem. This thesis studies and analyzes multi-path routing protocols from the known literature and derives a new algebraic condition which allows the correct operation of these protocols without any network restriction. It also develops a range of software tools that allows the planning and the respective verification/validation of new protocols models according to the study made.