{"title":"Car relocation for carsharing service: Comparison of CPLEX and greedy search","authors":"Rabih Zakaria, M. Dib, L. Moalic, A. Caminada","doi":"10.1109/CIVTS.2014.7009477","DOIUrl":"https://doi.org/10.1109/CIVTS.2014.7009477","url":null,"abstract":"In this paper, we present two approaches to solve the relocation problem in one-way carsharing system. We start by formulating the problem as an Integer Linear Programming Model. Then using mobility data collected from an operational carsharing system, we built demands matrices that will be used as input data for our solver. We notice that the time needed to solve the ILP using an exact solver increases dramatically when we increase the number of employees involved in the relocation process and when the system gets bigger. To cope with this problem, we develop a greedy algorithm in order to solve the relocation problem in a faster time. Our algorithm takes one second to solve the relocation problem in worst cases; also, we evaluated the robustness of the two approaches with stochastic input data using different numbers of employees.","PeriodicalId":283766,"journal":{"name":"2014 IEEE Symposium on Computational Intelligence in Vehicles and Transportation Systems (CIVTS)","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131411982","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Trust-based controller for convoy string stability","authors":"Dariusz G. Mikulski","doi":"10.1109/CIVTS.2014.7009480","DOIUrl":"https://doi.org/10.1109/CIVTS.2014.7009480","url":null,"abstract":"This paper describes a trust-based vehicle controller that can be tuned to ensure decentralized string stability in a convoy. The controller leverages the RoboTrust algorithm to mitigate risks associated with trust-based vulnerabilities, such as cyber attacks, poor decisions, and malfunctions. In our scenario, we simulate a simple convoy mission in which twelve vehicles move together between waypoints, stopping at each waypoint before proceeding. We examine the decisions of the convoy leader at each waypoint and show how its behaviors can introduce spacing errors throughout the convoy column. We then show how the trust-based controller can modify the leader's behaviors and minimize the effect of error propagation and amplification in the convoy.","PeriodicalId":283766,"journal":{"name":"2014 IEEE Symposium on Computational Intelligence in Vehicles and Transportation Systems (CIVTS)","volume":"141 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122981142","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Probabilistic modeling of navigation bridge officer's behavior","authors":"G. Psarros","doi":"10.1109/CIVTS.2014.7009489","DOIUrl":"https://doi.org/10.1109/CIVTS.2014.7009489","url":null,"abstract":"The performance of a navigating officer in critical situations is uncertain and has to be considered in a probabilistic framework, since this may provide an in depth insight in the human - machine interaction. Such a systematic approach will have the objective to understand, to predict and to minimize the role of the human as a causal factor for a casualty in terms of the time sequence needed to perform particular tasks during collision or grounding avoidance activities. By employing the exponential law, it is possible to quantify the cognitive processes of information acquisition, analysis, categorization, decision making and action implementation. Consequently, the minimum required time where an automated system may intervene is determined. In this way, it is expected that it is plausible to prevent the occurrence of a close encounter that could escalate in an accident. Albeit to the lack of an available and appropriate data set, the proposed concept is examined through the small sample results of a published simulation study.","PeriodicalId":283766,"journal":{"name":"2014 IEEE Symposium on Computational Intelligence in Vehicles and Transportation Systems (CIVTS)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128995025","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Multiobjective selection of input sensors for travel times forecasting using support vector regression","authors":"Jiri Petrlik, Otto Fucík, L. Sekanina","doi":"10.1109/CIVTS.2014.7009472","DOIUrl":"https://doi.org/10.1109/CIVTS.2014.7009472","url":null,"abstract":"In this paper we propose a new method for travel time prediction using a support vector regression model (SVR). The inputs of the method are data from license plate detection systems and traffic sensors such as induction loops or radars placed in the area. This method is mainly designed to be capable of dealing with missing values in the traffic data. It is able to create many different SVR models with different input variables. These models are dynamically switched according to which traffic variables are currently available. The proposed method was compared with a basic license plate based prediction approach. The results showed that the proposed method provides the prediction of better quality. Moreover, it is available for a longer period of time.","PeriodicalId":283766,"journal":{"name":"2014 IEEE Symposium on Computational Intelligence in Vehicles and Transportation Systems (CIVTS)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134219155","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Jorge Leonid Aching Samatelo, Thiago B. F. de Oliveira, A. Bazzan
{"title":"Traffic information extraction from a blogging platform using knowledge-based approaches and bootstrapping","authors":"Jorge Leonid Aching Samatelo, Thiago B. F. de Oliveira, A. Bazzan","doi":"10.1109/CIVTS.2014.7009471","DOIUrl":"https://doi.org/10.1109/CIVTS.2014.7009471","url":null,"abstract":"In this paper we propose a strategy to use messages posted in a blogging platform for real-time sensing of traffic-related information. Specifically, we use the data that appear in a blog, in Portuguese language, which is managed by a Brazilian daily newspaper on its online edition. We propose a framework based on two modules to infer the location and traffic condition from unstructured, non georeferenced short post in Portuguese. The first module relates to name-entity recognition (NER). It automatically recognizes three classes of named-entities (NEs) from the input post (LOCATION, STATUS and DATE). Here, a bootstrapping approach is used to expand the initially given list of locations, identifying new locations as well as locations corresponding to spelling variants and typographical errors of the known locations. The second module relates to relation extraction (RE). It extracts binary and ternary relations between such entities to obtain relevant traffic information. In our experiments, the NER module has yielded a F-measure of 96%, while the RE module resulted in 87%. Also, results show that our bootstrapping approach identifies 1;058 new locations when 10;000 short posts are analyzed.","PeriodicalId":283766,"journal":{"name":"2014 IEEE Symposium on Computational Intelligence in Vehicles and Transportation Systems (CIVTS)","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129357247","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Dynamic ridesharing with intermediate locations","authors":"K. Aissat, A. Oulamara","doi":"10.1109/CIVTS.2014.7009475","DOIUrl":"https://doi.org/10.1109/CIVTS.2014.7009475","url":null,"abstract":"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 at his ending location and continues to his target location. This approach lacks of flexibility and misses some possible matchings. In this paper, we propose a new ridesharing approach in which a driver and a rider accept to meet in an intermediate starting location and to separate in another intermediate ending location. This allows to reduce both the driver's detour and the total travel cost. We propose exact and heuristic methods to compute meeting points that minimize the total travel cost of the driver and the rider. We analyze their empirical performance on a set of real road networks consisting of up to 3,5 million nodes and 8,7 million edges. Our experimental analysis shows that our heuristics provide efficient performances within short CPU times and improves the recurring ridesharing approach.","PeriodicalId":283766,"journal":{"name":"2014 IEEE Symposium on Computational Intelligence in Vehicles and Transportation Systems (CIVTS)","volume":"110 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124685389","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Fitness function for evolutionary computation applied in dynamic object simulation and positioning","authors":"M. Woźniak","doi":"10.1109/CIVTS.2014.7009485","DOIUrl":"https://doi.org/10.1109/CIVTS.2014.7009485","url":null,"abstract":"In the paper an idea to apply evolutionary computation method with dedicated fitness function in dynamic system simulation and positioning is presented. Dedicated evolutionary system's efficiency in simulation, optimization and positioning of examined object is discussed. Presented experiments show common duty as well as extensive, overloading and dangerous situations at work. Research results are presented to discuss applied method.","PeriodicalId":283766,"journal":{"name":"2014 IEEE Symposium on Computational Intelligence in Vehicles and Transportation Systems (CIVTS)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134435879","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Autonomous running control system of an AGV by a tablet PC based on the wall-floor boundary line","authors":"Anar Zorig, Atsushi Haginiwa, Hiroyuki Sato","doi":"10.1109/CIVTS.2014.7009486","DOIUrl":"https://doi.org/10.1109/CIVTS.2014.7009486","url":null,"abstract":"In our research, we have studied the autonomous running control system of the automatic guided vehicles (AGV) used in the manufacturing facilities using the tablet PC. The moving direction of automatic vehicle is controlled by the results of image processing methods on captured images of the tablet PC. In the image processing step, after detecting edges we obtain wall-floor boundaries by analyzing those edges. By applying the least square method on the wall-floor boundaries, we calculate the moving direction of the AGV. To improve the accuracy of the moving direction, we divide the edge detection image into grid cells and remove all edges in cells with sparse edges. Furthermore, we divided all boundary points into vertical subdivisions, estimated unusual small boundaries and discarded them. As a result of our research, the running distance of the AGV was improved from 10 meters to the whole length of the testing course. The distance of testing course is 100 meters long.","PeriodicalId":283766,"journal":{"name":"2014 IEEE Symposium on Computational Intelligence in Vehicles and Transportation Systems (CIVTS)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134202266","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Predicting bikeshare system usage up to one day ahead","authors":"R. Giot, Raphael Cherrier","doi":"10.1109/CIVTS.2014.7009473","DOIUrl":"https://doi.org/10.1109/CIVTS.2014.7009473","url":null,"abstract":"Bike sharing systems are present in several modern cities. They provide citizens with an alternative and ecological mode of transportation, allowing them to avoid the use of personal car and all the problems associated with it in big cities (i.e., traffic jam, roads reserved for public transport, ...). However, they also suffer from other problems due to their success: some stations can be full or empty (i.e., impossibility to drop off or take a bike). Thus, to predict the use of such system can be interesting for the user in order to help him/her to plan his/her use of the system and to reduce the probability of suffering of the previously presented issues. This paper presents an analysis of various regressors from the state of the art on an existing public dataset acquired during two years in order to predict the global use of a bike sharing system. The prediction is done for the next twenty-four hours at a frequency of one hour. Results show that even if most regressors are sensitive to over-fitting, the best performing one clearly beats the baselines.","PeriodicalId":283766,"journal":{"name":"2014 IEEE Symposium on Computational Intelligence in Vehicles and Transportation Systems (CIVTS)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123171464","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
C. Luo, Yu-Ting Wu, N. M. Krishnan, M. Paulik, G. Jan, Jiyong Gao
{"title":"An effective search and navigation model to an auto-recharging station of driverless vehicles","authors":"C. Luo, Yu-Ting Wu, N. M. Krishnan, M. Paulik, G. Jan, Jiyong Gao","doi":"10.1109/CIVTS.2014.7009484","DOIUrl":"https://doi.org/10.1109/CIVTS.2014.7009484","url":null,"abstract":"An electric vehicle auto-recharging station is a component in an infrastructure supplying electric energy for the recharging of plug-in electric vehicles. An auto-recharging station is usually accessible to an autonomous driverless vehicle driven by intelligent algorithms. A driverless vehicle is assumed to be capable of autonomously searching and navigating it into a recharging station. In this paper, a novel hybrid intelligent system is developed to navigate an autonomous vehicle into a recharging station. The driverless vehicle driven by D*Lite path planning methodology in conjunction with a Vector Field Histogram (VFH) local navigator is developed for search and navigation purpose to reach an auto-recharging station with obstacle avoidance. Once it approaches vicinity of the recharging station, the driverless vehicle should be directed at the recharging station at a proper angle, which is accomplished by a Takagi-Sugeno fuzzy logic model. A novel error control of angle and distance heuristic approach is proposed to adjust the vehicle straight at the recharging station. Development of the driverless vehicle in terms of hardware and software design is described. Simulation studies on the Player/Stage platform demonstrate that the proposed model can successfully guide an autonomous driverless vehicle into the recharging station. Experimental effort shows its promising results that the driverless vehicle is able to autonomously navigate it to an auto-recharging station.","PeriodicalId":283766,"journal":{"name":"2014 IEEE Symposium on Computational Intelligence in Vehicles and Transportation Systems (CIVTS)","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123510481","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}