An adaptive battery reserve time prediction algorithm

Author(s):  
A.M. Pesco ◽  
R.V. Biagetti ◽  
R.S. Chidamber ◽  
C.R. Venkatram
Electronics ◽  
2021 ◽  
Vol 11 (1) ◽  
pp. 106
Author(s):  
Irfan Ahmed ◽  
Indika Kumara ◽  
Vahideh Reshadat ◽  
A. S. M. Kayes ◽  
Willem-Jan van den Heuvel ◽  
...  

Travel time information is used as input or auxiliary data for tasks such as dynamic navigation, infrastructure planning, congestion control, and accident detection. Various data-driven Travel Time Prediction (TTP) methods have been proposed in recent years. One of the most challenging tasks in TTP is developing and selecting the most appropriate prediction algorithm. The existing studies that empirically compare different TTP models only use a few models with specific features. Moreover, there is a lack of research on explaining TTPs made by black-box models. Such explanations can help to tune and apply TTP methods successfully. To fill these gaps in the current TTP literature, using three data sets, we compare three types of TTP methods (ensemble tree-based learning, deep neural networks, and hybrid models) and ten different prediction algorithms overall. Furthermore, we apply XAI (Explainable Artificial Intelligence) methods (SHAP and LIME) to understand and interpret models’ predictions. The prediction accuracy and reliability for all models are evaluated and compared. We observed that the ensemble learning methods, i.e., XGBoost and LightGBM, are the best performing models over the three data sets, and XAI methods can adequately explain how various spatial and temporal features influence travel time.


Author(s):  
Dwi Putri Handayani ◽  
Mustafid Mustafid ◽  
Bayu Surarso

Patient Treatment Time Prediction Algorithm was very important to build an outpatient queue system at the hospital. This study aims to build a system of outpatient queues to predict the waiting time of outpatients in the eye clinic at one of Cirebon hospitals. Patient Treatment Time Prediction algorithm was calculated based on historical data or medical records of patients in the hospital with 120 patient data. The Patient Treatment Time Prediction algorithm was trained by improved Random Forest algorithm for each service and a waiting time for each service. Prediction of waiting time for each patient service was obtained by calculating the consumption of patient care time based on patient characteristics. The waiting time for each service predicted by the trained Patient Treatment Time Prediction algorithm is the total waiting time of patients in the queue for each service. This research resulted in a system that can show the time taken by patients in every service available in the eye clinic. Patient time consumption in each service produced varies according to the patient's condition, in this case based on the patient's gender and age. This research provides benefits in terms of improving performance in each department involved, optimizing human resources, and increasing patient satisfaction. This research can be developed for each department in the hospital.


IARJSET ◽  
2017 ◽  
Vol 4 (5) ◽  
pp. 225-231
Author(s):  
Hanumantha K N ◽  
Sunitha S

2018 ◽  
Vol 189 ◽  
pp. 10004
Author(s):  
Qiangrong Yang ◽  
Qi Peng

Travel time prediction is an essential part of intelligent transportation system applications. However, the existing travel time prediction methods mainly focus on the freeway due to its simplicity and the high coverage of sensors and few researches have been conducted for the urban arterial road. Consequently, a travel time prediction algorithm based on particle filter is proposed in this paper to predict short-term travel time of the arterial traffic with historical floating car data and the concept of speed matrix is developed to illustrate the spatiotemporal properties of the arterial traffic. Unlike previous travel time prediction methods, the proposed algorithm uses particles with corresponding weights to model the traffic trend in the historical data instead of state-transition function and the weight for each particle are calculated with similarities between the speed matrix of the particle and the current traffic pattern. Moreover, a resampling process is developed to solve the degeneracy problem of the particles by replacing the low-weight particles with historical data. A real floating car dataset of 10357 taxis over a period of 3 months within Beijing is utilized to evaluate the performances of the algorithms. The proposed algorithm has the least errors by comparing with other three algorithms.


Sign in / Sign up

Export Citation Format

Share Document