In this paper, a learning-based optimal transportation algorithm for autonomous taxis and ridesharing vehicles is introduced. The goal is to design a mechanism to solve the routing problem for a fleet of autonomous ve...
详细信息
ISBN:
(纸本)9781538692882
In this paper, a learning-based optimal transportation algorithm for autonomous taxis and ridesharing vehicles is introduced. The goal is to design a mechanism to solve the routing problem for a fleet of autonomous vehicles in real-time in order to maximize the transportation company's profit. To solve this problem, the system is modeled as a Markov Decision Process (MDP) using past customers data. By solving the defined MDP, a centralized high-level planning recommendation is obtained, where this offline solution is used as an initial value for the real-time learning. Then, a distributed SARSA reinforcement learning algorithm is proposed to capture the model errors and the environment changes, such as variations in customer distributions in each area, traffic, and fares, thereby providing an accurate model and optimal policies in real-time. Agents are using only their local information and interaction, such as current passenger requests and estimates of neighbors' tasks and their optimal actions, to obtain the optimal policies in a distributed fashion. The agents use the estimated values of each action, provided by distributed SARSA reinforcement learning, in a distributed game-theory based task assignment to select their conflict-free customers. Finally, the customers data provided by the city of Chicago is used to validate the proposed algorithms.
CPAchecker is a framework for software verification, built on the foundations of Configurable Program Analysis (CPA). For the SV-COMP'14, we file a CPAchecker configuration that runs up to five analyses in sequenc...
详细信息
The paper presents a twofold verification system that aimes to be an open platform for experimentation with various verification techniques as well as an industrial-ready domain specific verification tool for Linux de...
详细信息
The problem of search efficiency through large amount of text data is well-known problem in computer science. We would like to introduce a BST data structure that allows searches through a set of string values, and is...
详细信息
The problem of search efficiency through large amount of text data is well-known problem in computer science. We would like to introduce a BST data structure that allows searches through a set of string values, and is optimized for reading and writing large blocks of data. This paper describes the algorithms for insertion, deletion and search of variable-length strings in diskresident trie structures. This data structure is used for value indexes on XML data. We also compare our implementation with existing B+ tree implementation and show that our structure occupies several times less space with the same search efficiency.
Write-then-read transaction (W\R) is a transaction that consists of two consecutive phases: write phase containing write and read operations in random order, and second phase containing read operations and write opera...
详细信息
Write-then-read transaction (W\R) is a transaction that consists of two consecutive phases: write phase containing write and read operations in random order, and second phase containing read operations and write operations only on data items previously updated in the first phase. W\R transactions are of great practical importance, but the problem of efficient processing of such transactions has received only little attention of research community so far. In this paper, we present Dynamic Versioning Protocol (DVP), which optimizes W\R transactions processing using versions on the second phase. DVP supports STEAL policy and incorporates dynamic approach to the problem of selecting most suitable versions for read operations of the read phase. We prove the correctness of our protocol, so it guarantees the serializability of all transactions. The conducted experimental evaluation shows significant benefits of DVP for processing of concurrent W\R transactions.
UniTESK is a testing technology based on formal models or formal specifications of requirements to the behavior of software and hardware components. The most significant applications of UniTESK in industrial projects ...
详细信息
UniTESK is a testing technology based on formal models or formal specifications of requirements to the behavior of software and hardware components. The most significant applications of UniTESK in industrial projects are described, the experience is summarized, and the prospective directions to the Component Model Based Testing development are estimated.
In this paper we consider the problem of efficiently producing results for full-text keyword search queries over XML documents. We describe full-text search query semantics and propose a method for efficient evaluatio...
详细信息
In this paper we consider the problem of efficiently producing results for full-text keyword search queries over XML documents. We describe full-text search query semantics and propose a method for efficient evaluation of keyword search queries with these semantics suitable for native XML databases. Method uses inverted file index which may be efficiently updated when a part of some XML document is updated.
This paper discusses a problem of ensuring backward binary compatibility of Linux shared libraries. Breakage of the compatibility may result in crashing or incorrect behavior of applications built with an old version ...
详细信息
Several native approaches to storing large XML data sets exist. In all of these approaches the internal data representation is designed to support any ad-hoc XQuery query. In this paper we argue that XQuery and its da...
详细信息
Several native approaches to storing large XML data sets exist. In all of these approaches the internal data representation is designed to support any ad-hoc XQuery query. In this paper we argue that XQuery and its data model are too universal and any one-size-fits-all XML representation leads to significant overheads in terms of representation size and complexity. Based on the consideration that in many applications queries/updates workload is known in advance and does not change often, we propose an application-tailored XML storage. Elimination of the superfluous XQuery data model features and utilization of the various physical data representations improve performance on the specified workload, while ad-hoc queries support can be limited.
There is a growing number of XML database systems of different kinds now on the market. XML DBMS vendors rushed to enrich their products with more flexible and advanced features to make them satisfy the requirements o...
详细信息
There is a growing number of XML database systems of different kinds now on the market. XML DBMS vendors rushed to enrich their products with more flexible and advanced features to make them satisfy the requirements of modern applications. And the time is ripe for the database research community to study the issues involved with extending XML DBMS with capabilities analogous to those that are popular in traditional DBMS, keeping in mind that XML databases now become a widespread means for storing and exchanging information on the Web, and increasingly used in dynamic applications such as e-commerce. In this paper, being bound for the issues, we provide a definition of triggers for XML based on XQuery and a previously defined update language, and methods to support triggers in XML database systems.
暂无评论