The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
This paper presents a distributed clustering algorithm, called DCEV, which constructs multi-hop clusters. DCEV places vehicles into non-overlapping clusters which have adaptive size based on their relative mobility. The cluster formation is based on a D-hop clustering scheme where each node selects its cluster head in at most D-hop distance. To create clusters, DCEV uses a new metric to let vehicles...
A network with dynamic weights implies a set of vertices interconnected by a set of edges, each of which bears a weight that changes with time. One example of such networks is a traffic network, wherein, the structure of the graph remains constant but the weight on the edges, signifying the amount of traffic (traffic density) changes over time. We have dealt with scenarios where flow algorithm needs...
The communication graph formed by vehicles is an abstract and dynamic graph that faces intermittent disconnections due to the high mobility of vehicles. This graph is governed by traffic signaling, urban planning and drivers behaviours. Even if Social Network Analysis (SNA) proved its benefits in the study of abstract social networks, it poses new challenges when applied to dynamic networks such as...
Vehicular ad-hoc network (VANET) is an important technology for future development of intelligent transportation systems. VANETs are being used as a tool for improving road safety by warning the drivers about accidents occurred ahead of them or for providing internet access to the passengers via gateways along the road. Although VANET is an application of MANETs but routing of data packets is more...
Ridesharing concerns people that are willing to intelligently ride in order to save money and protect environment. The idea is based on a better use of private car. More precisely, it aims to bring together individuals that share, even partially, a trip. In the recurring ridesharing problem, when an offer is matched with a demand, the driver picks-up the rider at his starting location, drops him off...
We propose multiscale metrics to capture the quality of coverage by a static configuration of agents. This metric is used for the locational optimization of sensor networks. Agent configurations that minimize the multiscale coverage metric are an alternative to the well-known centroidal voronoi tesselations. Other applications include quantization and clustering analysis. We demonstrate the performance...
In this paper, we use the NCTUns network simulator to study intelligent traffic signal control algorithms. NCTUns is both a microscopic traffic simulator and a network simulator. We imported the real-life map of a district of the Taipei city into NCTUns to let simulated vehicles move on the roads of the imported map. Then, we used a new and unique feature of NCTUns - each simulated vehicle moves towards...
Incremental sampling-based motion planning algorithms such as the Rapidly-exploring Random Trees (RRTs) have been successful in efficiently solving computationally challenging motion planning problems involving complex dynamical systems. A recently proposed algorithm, called the RRT*, also provides asymptotic optimality guarantees, i.e., almost-sure convergence to optimal trajectories (which the RRT...
Maneuvering autonomous vehicles in constrained environments, such as autonomous vehicle parking, is not a trivial task and has received increasing attention from both the academy and industry. However, the traditional methods divide the problem into parallel parking, perpendicular parking, and echelon parking, then different methods are applied for the parking motion planning. In this paper a Rapidly-exploring...
Capacitated Arc Routing Problem (CARP) has drawn much attention during the last few years because of its applications in the real world. Recently, we developed a Memetic Algorithm with Extended Neighborhood Search (MAENS), which is powerful in solving CARP. The excellent performance of MAENS is mainly due to one of its local search operators, namely the Merge-Split (MS) operator. However, the higher...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.