Correction: Sarmadi et al. Attention Horizon as a Predictor for the Fuel Consumption Rate of Drivers. Sensors 2022, 22, 2301
Hamid Sarmadi, Sławomir Nowaczyk, Rune Prytz, Miguel Simão

Abstract
Genes, proteins, chemicals, diseases, species, mutations and cell lines named across the full text — each resolved to its canonical identifier and authoritative record.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsVehicle emissions and performance · Air Quality Monitoring and Forecasting · Air Quality and Health Impacts
Error in Algorithms 1 and 2
Algorithms 1 and 2 have been updated, with the new, correct versions shown below. The lines that needed to be corrected from the original paper [1] are annotated with dashed-line boxes. In the boxes below, you can see the corrections. Algorithm 1 Finding the set of paths before stopping at red traffic lights during a day for a vehicleProcedure FindPaths(C, S, T) SP ← { i | s_i_ ∈ S ∧ s_i_ < 1 }// All point indices with slow vehicle speed P←∅// P: The set of extracted traffic light paths For* i* ∈ SP If ∄ (R, D) ∈ P such that i ∈ R t ← T(c_i_)// t: coordinates of the closest traffic light j ← i + 1 While j ≤ N ∧ (dist(c_j_, t) < dist(c_j__−1, t) ∧ dist(*c_j, t) < 50)// Distance unit is meters j ← j + 1 End While If dist(c_j_₋_1*, t) < 5//Distance unit is meters While j > 1 ∧ (j−1 ∈ SP ∨ j ∉ SP)//Go back to the last slowdown point *j *← j − 1 End While P ← P ∪ CreatePath(C, j, t, P) Break End If End If End For Return PEnd Procedure Algorithm 2 Creating a path given its closest point to the traffic lightProcedure CreatePath(C, j, t, P) k ← 1 *d_k* ← 0// d_k_: Traversed distance to the stopping point at the path’s k-th index r_k_ ← j// r_k_: The data point index at the path’s k-th index While d_k_ < L_p_ ∧ r_k_ > 1 ∧ [∄ (R, D) ∈* P* such that r_k_−1 ∈ R] k ← k + 1 *r_k* ← *r_k_−1 − 1 *d_k ← d_k_−1 + dist(crk,crk−1) End While R ← ⟨r_1_, r_2_, ..., r_k_⟩ D ← ⟨d_1_, d_2_, ..., d_k_⟩ If d_k_ ≥ L_p_// If the path’s traversed distance is greater than L_p_ **Return **{(R, D)} Else **Return **∅ End If****End Procedure
The authors state that the scientific conclusions are unaffected. This correction was approved by the Academic Editor. The original publication has also been updated.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
