Incremental Route Research Articles

Incremental route inference from low-sampling GPS data: An opportunistic approach to online map matching

With the surging of smart device sensing and mobile networking, GPS data has been widely available for identifying vehicle position and route on the road map. For many real-time applications, such as traffic sensing and route recommendation, it is critical to immediately infer travelling route with incoming GPS data. In this paper, an opportunistic approach to online map matching is proposed to incrementally infer routes from low-sampling GPS data with low output latency. Unlike the hidden Markov model (HMM)-based approach, which often experiences certain delay between the GPS observation and inference, our algorithm can produce immediate inference when a new GPS point becomes available. Furthermore, a rollback mechanism is provided to correct the already inferred route when some abnormal situations are detected during the opportunistic inference process. We evaluate the proposed algorithm using real dataset of GPS trajectories over 100 cities around the world. Experimental results show that our algorithm is better than, or at least comparable to the state-of-the-art algorithms in terms of inference accuracy. More importantly, our algorithm can yield much shorter output latency and require less execution time, which is critical for many real-time navigation applications and location-based services.

Region-based prescriptive route guidance for travelers of multiple classes

The performance and complicated interactions of different classes of travelers on regional urban networks are presented and analyzed. A new multi-class extension of a regional dynamic traffic model, the Network Transmission Model is proposed. The classes in question correspond to travelers using autonomous vehicles, conventional vehicles, equipped with Route Guidance and Information Systems, and unequipped vehicles. Each class is represented by a different routing method. Incremental Route Planning, an innovative predictive simulation-based routing method, Proxy Regret Matching, a non-predictive strategic learning-based method and Multinomial Logit-based Routing for 1st, 2nd and 3rd class respectively. All routing methods include a Public Transit Diversion mechanism and are assumed to provide prescriptive route guidance, with pre-trip information dissemination for every departing vehicle. We consider the possibility of non-compliance for conventional vehicles equipped with Route Guidance and Information Systems. We also consider 2 possible scenarios for autonomous vehicles that affect their travel time prediction accuracy. We simulate regional traffic dynamics for simultaneous application of all aforementioned routing methods, employing a market penetration scheme for each class of travelers. We analyze results regarding the overall network performance for various combinations of traveler class market penetration rates and non-compliance rates. We come to the conclusion that autonomous vehicles will not only provide benefits for 1st class travelers, but for all traveler classes on the network.

Three routes forward for biofuels: Incremental, leapfrog, and transitional

This paper examines three technology routes for lowering the carbon intensity of biofuels: (1) a leapfrog route that focuses on major technological breakthroughs in lignocellulosic pathways at new, stand-alone biorefineries; (2) an incremental route in which improvements are made to existing U.S. corn ethanol and soybean biodiesel biorefineries; and (3) a transitional route in which biotechnology firms gain experience growing, handling, or chemically converting lignocellulosic biomass in a lower-risk fashion than leapfrog biorefineries by leveraging existing capital stock. We find the incremental route is likely to involve the largest production volumes and greenhouse gas benefits until at least the mid-2020s, but transitional and leapfrog biofuels together have far greater long-term potential. We estimate that the Renewable Fuel Standard, California's Low Carbon Fuel Standard, and federal tax credits provided an incentive of roughly $1.5–2.5 per gallon of leapfrog biofuel between 2012 and 2015, but that regulatory elements in these policies mostly incentivize lower-risk incremental investments. Adjustments in policy may be necessary to bring a greater focus on transitional technologies that provide targeted learning and cost reduction opportunities for leapfrog biofuels.

Single event upset induced multi-block error and its mitigation strategy for SRAM-based FPGA

According to the SRAM-based FPGA’s single event effect problem in space application, single event upset induced multi-block error (SEU-MBE) phenomenon and its mitigation strategy are studied in the paper. After analyzing the place and route result, the paper points out that the essence of SEU-MBE is that some important modules exceed the safe internal distance. Two approaches, area constraint method (ACM) and incremental route algorithm (IRA), are proposed, which can reduce the error rate by manipulating programmable switch matrix and interconnection points within FPGA route resource. Fault injection experiments indicate that error detection rate is above 98.6% for both strategies, and FPGA resources increment and performance penalty are around 10%.

Synthesis of silica-polymer hybrids by combination of RAFT polymerization and azide-alkyne cycloaddition ‘click’ reactions

An original strategy is presented to synthesize highly pure multiblock copolymers (up to tetrablock) of various monomers tethered to silica particles, by combining RAFT polymerization and click chemistry. Two approaches were compared that follow this strategy. In a first approach, Z-azide-functionalized polymers were prepared via a RAFT process and then tethered to silica particles via a direct click reaction. This approach led to well-defined grafted polymers with polydispersity indices lower than their “as-prepared” precursors, due to lack of dead chains. In a second approach, a one-pot method was employed, using clickable RAFT agents to perform RAFT polymerization and click reaction simultaneously. This route afforded grafted polymers with polydispersity typically less than 1.25, whilst the chain length of grafted polymers was usually shorter than that of free polymers formed in solution, due to shielding effect and heterogeneous reaction condition. A series of well-defined homopolymers, di-, tri- and tetrablock copolymers could be efficiently grafted onto silica particles, and the grafting density was usually ranged between 0.017 and 0.085 chains nm−2, evident from GPC, IR, elemental and thermogravimetric analyses. The one-pot approach seems more promising than the incremental route, since it is a one step reaction that still maintains controllability over surface modification.

Hydrogen futures: toward a sustainable energy system

Fueled by concerns about urban air pollution, energy security, and climate change, the notion of a “hydrogen economy” is moving beyond the realm of scientists and engineers and into the lexicon of political and business leaders. Interest in hydrogen, the simplest and most abundant element in the universe, is also rising due to technical advances in fuel cells — the potential successors to batteries in portable electronics, power plants, and the internal combustion engine. But where will the hydrogen come from? Government and industry, keeping one foot in the hydrocarbon economy, are pursuing an incremental route, using gasoline or methanol as the source of the hydrogen, with the fuel reformed on board vehicles. A cleaner path, deriving hydrogen from natural gas and renewable energy and using the fuel directly on board vehicles, has received significantly less support, in part because the cost of building a hydrogen infrastructure is widely viewed as prohibitively high. Yet a number of recent studies suggest that moving to the direct use of hydrogen may be much cleaner and far less expensive. Just as government played a catalytic role in the creation of the Internet, government will have an essential part in building a hydrogen economy. Research and development, incentives and regulations, and partnerships with industry have sparked isolated initiatives. But stronger public policies and educational efforts are needed to accelerate the process. Choices made today will likely determine which countries and companies seize the enormous political power and economic prizes associated with the hydrogen age now dawning.

Cognitive incrementalism: The big issue

Neural organization raises, in an especially clear way, a major problem confronting contemporary cognitive science. The problem (the “big issue” of my title) is: What is the relation between the strategies used to solve basic problems of perception and action and those used to solve more abstract or “cognitive” problems? Is there a smooth, incremental route from what Arbib et al. call “instinctual schemas” to higher-level kinds of cognitive prowess? I argue that, despite some suggestive comments, Arbib et al. do not resolve this issue.

From vision to multimodal communication: Incremental route descriptions

From vision to multimodal communication: Incremental route descriptions

Tree-forming reversible routes in communication networks

Tree-forming reversible routes are characterized by two constraints. The first, a strong form of route uniqueness, states that there may be no more than one route between any pair of nodes. It is called the tree-forming constraint as it implies that the set of routes to each node form a tree rooted at that node. The other constraint is reversibility: if the route from one node to a second is described as a sequence of nodes or links, the route from the second to the first must be the reverse sequence. The simplicity of these constraints is deceptive, and route definition turns out be non-intuitive and rather difficult. In this paper, a route-definition procedure is considered in which all consequences of a route selection are computed before the next selection is allowed. General properties and problems of tree-forming reversible routing systems are discussed, and an interactive, incremental route definition program is briefly described.