Performance testing of an improved driver restraint system for subcompact cars. Volume II - final report.

National Highway Traffic Safety Administration, Washington, D.C.

An analysis of guardrail and median barrier accidents using the Longitudinal Barrier Special Studies (LBSS) file. Volume I: final report.

Federal Highway Administration, Office of Safety and Traffic Operations Research and Development, McLean, Va.

An analysis of guardrail and median barrier accidents using the Longitudinal Barrier Special Studies (LBSS) file. Volume II: users guide.

Federal Highway Administration, Office of Safety and Traffic Operations Research and Development, McLean, Va.

Papers on adult seat belts - effectiveness and use. Technical report.

Mode of access: Internet.

Bright dipolar Bose-Einstein-condensate soliton mobile in a direction perpendicular to polarization

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

An algorithm for the strip packing problem using collision free region and exact fitting placement

The irregular shape packing problem is approached. The container has a fixed width and an open dimension to be minimized. The proposed algorithm constructively creates the solution using an ordered list of items and a placement heuristic. Simulated annealing is the adopted metaheuristic to solve the optimization problem. A two-level algorithm is used to minimize the open dimension of the container. To ensure feasible layouts, the concept of collision free region is used. A collision free region represents all possible translations for an item to be placed and may be degenerated. For a moving item, the proposed placement heuristic detects the presence of exact fits (when the item is fully constrained by its surroundings) and exact slides (when the item position is constrained in all but one direction). The relevance of these positions is analyzed and a new placement heuristic is proposed. Computational comparisons on benchmark problems show that the proposed algorithm generated highly competitive solutions. Moreover, our algorithm updated some best known results. (C) 2012 Elsevier Ltd. All rights reserved.

Miocene basin development and volcanism along a strike-slip to flat-slab subduction transition: Stratigraphy, geochemistry, and geochronology of the central Wrangell volcanic belt, Yakutat-North America collision zone

New geochronologic, geochemical, sedimentologic, and compositional data from the central Wrangell volcanic belt (WVB) document basin development and volcanism linked to subduction of overthickened oceanic crust to the northern Pacific plate margin. The Frederika Formation and overlying Wrangell Lavas comprise >3 km of sedimentary and volcanic strata exposed in the Wrangell Mountains of south-central Alaska (United States). Measured stratigraphic sections and lithofacies analyses document lithofacies associations that reflect deposition in alluvial-fluvial-lacustrine environments routinely influenced by volcanic eruptions. Expansion of intrabasinal volcanic centers prompted progradation of vent-proximal volcanic aprons across basinal environments. Coal deposits, lacustrine strata, and vertical juxtaposition of basinal to proximal lithofacies indicate active basin subsidence that is attributable to heat flow associated with intrabasinal volcanic centers and extension along intrabasinal normal faults. The orientation of intrabasinal normal faults is consistent with transtensional deformation along the Totschunda-Fairweather fault system. Paleocurrents, compositional provenance, and detrital geochronologic ages link sediment accumulation to erosion of active intrabasinal volcanoes and to a lesser extent Mesozoic igneous sources. Geochemical compositions of interbedded lavas are dominantly calc-alkaline, range from basaltic andesite to rhyolite in composition, and share geochemical characteristics with Pliocene-Quaternary phases of the western WVB linked to subduction-related magmatism. The U/Pb ages of tuffs and Ar-40/Ar-39 ages of lavas indicate that basin development and volcanism commenced by 12.5-11.0 Ma and persisted until at least ca. 5.3 Ma. Eastern sections yield older ages (12.5-9.3 Ma) than western sections (9.6-8.3 Ma). Samples from two western sections yield even younger ages of 5.3 Ma. Integration of new and published stratigraphic, geochronologic, and geochemical data from the entire WVB permits a comprehensive interpretation of basin development and volcanism within a regional tectonic context. We propose a model in which diachronous volcanism and transtensional basin development reflect progressive insertion of a thickened oceanic crustal slab of the Yakutat microplate into the arcuate continental margin of southern Alaska coeval with reported changes in plate motions. Oblique northwestward subduction of a thickened oceanic crustal slab during Oligocene to Middle Miocene time produced transtensional basins and volcanism along the eastern edge of the slab along the Duke River fault in Canada and subduction-related volcanism along the northern edge of the slab near the Yukon-Alaska border. Volcanism and basin development migrated progressively northwestward into eastern Alaska during Middle Miocene through Holocene time, concomitant with a northwestward shift in plate convergence direction and subduction collision of progressively thicker crust against the syntaxial plate margin.

Optimal Impulsive Collision Avoidance

The problem of optimal impulsive collision avoidance between two colliding objects in 3-dimensional elliptical Keplerian orbits is investigated with the purpose of establishing the optimal impulse direction and orbit location that give rise to the maximum miss distance following the maneuver. Closed-form analytical expressions are provided that predicts such distance and can be employed to perform a full optimization analysis. After verifying the accuracy of the expression for any orbital eccentricity and encounter geometry the optimum maneuver direction is derived as a function of the arc length separation between the maneuver point and the predicted collision point. The provided formulas can be used for high accuracy instantaneous estimation of the outcome of a generic impulsive collision avoidance maneuver and its optimization

Multiple robots formation manoeuvring and collision avoidance strategy

This paper presents a multiple robots formation manoeuvring and its collision avoidance strategy. The direction priority sequential selection algorithm is employed to achieve the raw path, and a new algorithm is then proposed to calculate the turning compliant waypoints supporting the multi-robot formation manoeuvre. The collision avoidance strategy based on the formation control is presented to translate the collision avoidance problem into the stability problem of the formation. The extension-decomposition-aggregation scheme is next applied to solve the formation control problem and subsequently achieve the collision avoidance during the formation manoeuvre. Simulation study finally shows that the collision avoidance problem can be conveniently solved if the stability of the constructed formation including unidentified objects can be satisfied.

Multi-vehicles interaction graph model for cooperative collision warning system

Cooperative collision warning system for road vehicles, enabled by recent advances in positioning systems and wireless communication technologies, can potentially reduce traffic accident significantly. To improve the system, we propose a graph model to represent interactions between multiple road vehicles in a specific region and at a specific time. Given a list of vehicles in vicinity, we can generate the interaction graph using several rules that consider vehicle's properties such as position, speed, heading, etc. Safety applications can use the model to improve emergency warning accuracy and optimize wireless channel usage. The model allows us to develop some congestion control strategies for an efficient multi-hop broadcast protocol.

Correlating eye gaze direction, depth and vehicle information on an interactive map for driver training

The over represented number of novice drivers involved in crashes is alarming. Driver training is one of the interventions aimed at mitigating the number of crashes that involve young drivers. Experienced drivers have better hazard perception ability compared to inexperienced drivers. Eye gaze patterns have been found to be an indicator of the driver's competency level. The aim of this paper is to develop an in-vehicle system which correlates information about the driver's gaze and vehicle dynamics, which is then used to assist driver trainers in assessing driving competency. This system allows visualization of the complete driving manoeuvre data on interactive maps. It uses an eye tracker and perspective projection algorithms to compute the depth of gaze and plots it on Google maps. This interactive map also features the trajectory of the vehicle and turn indicator usage. This system allows efficient and user friendly analysis of the driving task. It can be used by driver trainers and trainees to understand objectively the risks encountered during driving manoeuvres. This paper presents a prototype that plots the driver's eye gaze depth and direction on an interactive map along with the vehicle dynamics information. This prototype will be used in future to study the difference in gaze patterns in novice and experienced drivers prior to a certain manoeuvre.

Modified alternating direction methods for solving a two-dimensional non-continuous seepage flow with fractional derivatives

In this paper, a two-dimensional non-continuous seepage flow with fractional derivatives (2D-NCSF-FD) in uniform media is considered, which has modified the well known Darcy law. Using the relationship between Riemann-Liouville and Grunwald-Letnikov fractional derivatives, two modified alternating direction methods: a modified alternating direction implicit Euler method and a modified Peaceman-Rachford method, are proposed for solving the 2D-NCSF-FD in uniform media. The stability and consistency, thus convergence of the two methods in a bounded domain are discussed. Finally, numerical results are given.

Robot path planning in dynamic environments using a simulated annealing based approach

Mobile robots are widely used in many industrial fields. Research on path planning for mobile robots is one of the most important aspects in mobile robots research. Path planning for a mobile robot is to find a collision-free route, through the robot’s environment with obstacles, from a specified start location to a desired goal destination while satisfying certain optimization criteria. Most of the existing path planning methods, such as the visibility graph, the cell decomposition, and the potential field are designed with the focus on static environments, in which there are only stationary obstacles. However, in practical systems such as Marine Science Research, Robots in Mining Industry, and RoboCup games, robots usually face dynamic environments, in which both moving and stationary obstacles exist. Because of the complexity of the dynamic environments, research on path planning in the environments with dynamic obstacles is limited. Limited numbers of papers have been published in this area in comparison with hundreds of reports on path planning in stationary environments in the open literature. Recently, a genetic algorithm based approach has been introduced to plan the optimal path for a mobile robot in a dynamic environment with moving obstacles. However, with the increase of the number of the obstacles in the environment, and the changes of the moving speed and direction of the robot and obstacles, the size of the problem to be solved increases sharply. Consequently, the performance of the genetic algorithm based approach deteriorates significantly. This motivates the research of this work. This research develops and implements a simulated annealing algorithm based approach to find the optimal path for a mobile robot in a dynamic environment with moving obstacles. The simulated annealing algorithm is an optimization algorithm similar to the genetic algorithm in principle. However, our investigation and simulations have indicated that the simulated annealing algorithm based approach is simpler and easier to implement. Its performance is also shown to be superior to that of the genetic algorithm based approach in both online and offline processing times as well as in obtaining the optimal solution for path planning of the robot in the dynamic environment. The first step of many path planning methods is to search an initial feasible path for the robot. A commonly used method for searching the initial path is to randomly pick up some vertices of the obstacles in the search space. This is time consuming in both static and dynamic path planning, and has an important impact on the efficiency of the dynamic path planning. This research proposes a heuristic method to search the feasible initial path efficiently. Then, the heuristic method is incorporated into the proposed simulated annealing algorithm based approach for dynamic robot path planning. Simulation experiments have shown that with the incorporation of the heuristic method, the developed simulated annealing algorithm based approach requires much shorter processing time to get the optimal solutions in the dynamic path planning problem. Furthermore, the quality of the solution, as characterized by the length of the planned path, is also improved with the incorporated heuristic method in the simulated annealing based approach for both online and offline path planning.