skip to main content
10.1145/2695664.2696004acmconferencesArticle/Chapter ViewAbstractPublication PagessacConference Proceedingsconference-collections
short-paper

Efficient approach for reusing and sharing train driving plans using case-based reasoning

Published: 13 April 2015 Publication History

Abstract

This paper presents an efficient collaboration approach for reusing and sharing freight train driving plans P using case-based reasoning (CBR). P is formed by a set of actions that can move a train from one end to the other in a railroad. Collaboration is established by sharing different train driving experiences in different stretches. Three agents are positioned at each end: Planner, Executor, and Memory. Planner is responsible for generating P. Executor tests/adjusts (if necessary)/executes the actions of P. Until the train reaches the end, P may undergo δ adjustments depending on environmental conditions. The modified plan P + δ is returned to the origin to be integrated into the local experience base, maintained by the Memory. The approach was evaluated according the fuel consumption, accuracy of the case recovery task, and efficiency of task adaptation and application of such cases. The expansion of the experiences reduced the efforts of both the Planner and the Executor. In addition, our approach allowed the reuse, with low effort, of the obtained experiences in similar scenarios.

References

[1]
T. Baeck, D. Fogel, and Z. Michalewicz. Evolutionary Computation 1: Basic Algorithms and Operators. Basic algorithms and operators. Taylor & Francis, 2000.
[2]
J. Bajo, J. Corchado, and S. Rodríguez. Intelligent guidance and suggestions using case-based planning. In R. Weber and M. Richter, editors, Case-Based Reasoning Research and Development, volume 4626 of Lecture Notes in Computer Science, pages 389--403. Springer Berlin Heidelberg, 2007.
[3]
A. Borges, O. Dordal, D. Sato, B. Avila, F. Enembreck, and E. Scalabrin. An intelligent system for driving trains using case-based reasoning. In Systems, Man, and Cybernetics (SMC), 2012 IEEE International Conference on, pages 1694--1699, Oct 2012.
[4]
W. Fang, J. Sun, X. Wu, and X. Yao. Re-scheduling in railway networks. In Computational Intelligence (UKCI), 2013 13th UK Workshop on, pages 342--352, Sept 2013.
[5]
J. Kolodner. Case-based Reasoning. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 1993.
[6]
J. Loumiet, W. Jungbauer, and B. Abrams. Train Accident Reconstruction and FELA and Railroad Litigation. Lawyers & Judges Publishing Company, 2005.
[7]
S. Luke, L. Panait, G. Balan, and Et. Ecj 21: A java-based evolutionary computation research system, 2014.
[8]
J. Magalhães Mendes. A comparative study of crossover operators for genetic algorithms to solve the job shop scheduling problem. WSEAS Transactions on Computers, 12(4):164--173, 2013.
[9]
D. Sato, A. Borges, A. Leite, O. Dordal, B. Avila, F. Enembreck, and E. Scalabrin. Lessons learned from a simulated environment for trains conduction. In Industrial Technology (ICIT), 2012 IEEE International Conference on, pages 533--538, March 2012.
[10]
S. Vacek, T. Gindele, J. Zollner, and R. Dillmann. Using case-based reasoning for autonomous vehicle guidance. In Intelligent Robots and Systems, 2007. IROS 2007. IEEE/RSJ International Conference on, pages 4271--4276, Oct 2007.
[11]
M. Wooldridge and N. R. Jennings. Intelligent agents: Theory and practice. Knowledge Engineering Review, 10(2):115--152, 1995.

Cited By

View all
  • (2016)Autonomous Driving Trains to Pass in Bidirectional Crossing Loop Preventing StopsProcedia Computer Science10.1016/j.procs.2016.08.12996:C(197-206)Online publication date: 1-Oct-2016

Index Terms

  1. Efficient approach for reusing and sharing train driving plans using case-based reasoning

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    SAC '15: Proceedings of the 30th Annual ACM Symposium on Applied Computing
    April 2015
    2418 pages
    ISBN:9781450331968
    DOI:10.1145/2695664
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 13 April 2015

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. case-based reasoning
    2. driving of trains
    3. intelligent agent

    Qualifiers

    • Short-paper

    Conference

    SAC 2015
    Sponsor:
    SAC 2015: Symposium on Applied Computing
    April 13 - 17, 2015
    Salamanca, Spain

    Acceptance Rates

    SAC '15 Paper Acceptance Rate 291 of 1,211 submissions, 24%;
    Overall Acceptance Rate 1,650 of 6,669 submissions, 25%

    Upcoming Conference

    SAC '25
    The 40th ACM/SIGAPP Symposium on Applied Computing
    March 31 - April 4, 2025
    Catania , Italy

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)1
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 20 Jan 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2016)Autonomous Driving Trains to Pass in Bidirectional Crossing Loop Preventing StopsProcedia Computer Science10.1016/j.procs.2016.08.12996:C(197-206)Online publication date: 1-Oct-2016

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media