• Login
    View Item 
    •   Home
    • Theses & Dissertations
    • 2017 - Mines Theses & Dissertations
    • View Item
    •   Home
    • Theses & Dissertations
    • 2017 - Mines Theses & Dissertations
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

    All of Mines RepositoryCommunitiesPublication DateAuthorsTitlesSubjectsThis CollectionPublication DateAuthorsTitlesSubjects

    My Account

    Login

    Mines Links

    Arthur Lakes LibraryColorado School of Mines

    Statistics

    Display Statistics

    Practical military applications of timetabling, path planning, and time-varying networks for maximizing mission success and minimizing risk

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Thumbnail
    Name:
    Richards_mines_0052E_11353.pdf
    Size:
    2.605Mb
    Format:
    PDF
    Download
    Author
    Richards, Christopher D.
    Advisor
    Mehta, Dinesh P.
    Newman, Alexandra M.
    Date issued
    2017
    Keywords
    integer program
    network
    Voronoi
    naval mines
    A* search
    university timetabling
    
    Metadata
    Show full item record
    URI
    https://hdl.handle.net/11124/171790
    Abstract
    This dissertation consists of three papers in various stages of publication. The first paper, "Optimal Course Scheduling for United States Air Force Academy Cadets" is currently in the final stage of review by the journal Interfaces. The paper presents a mixed integer program that considers faculty preferences along with cadet military, athletic, and academic requirements for on-time commissioning. The model is developed as part of an iterative process between faculty and the registrar to build course timetables and student schedules that honor the limited university resources and manpower. The second paper, "Minimum-Risk Routing Through a Mapped Minefield," has been submitted and is currently under review by Networks. We build a "threat-additive" approach to measuring the risk incurred by a ship navigating a naval minefield. We employ this approach, both as an integer program and as an A* search, to identify minimum-risk paths that may not be found by traditional "edge-additive" models. The last paper, "Navigating Free-Floating Minefields via Time-Evolving Voronoi Graphs," is ready for submission pending journal-specific formatting. We use environmental data to generate Voronoi graphs representing static "snapshots" of a free-floating minefield over time. Using these snapshots, we build a time-varying graph through which parametrically defined minimum-risk journeys can be found.
    Rights
    Copyright of the original work is retained by the author.
    Collections
    2017 - Mines Theses & Dissertations

    entitlement

     
    DSpace software (copyright © 2002 - 2023)  DuraSpace
    Quick Guide | Contact Us
    Open Repository is a service operated by 
    Atmire NV
     

    Export search results

    The export option will allow you to export the current search results of the entered query to a file. Different formats are available for download. To export the items, click on the button corresponding with the preferred download format.

    By default, clicking on the export buttons will result in a download of the allowed maximum amount of items.

    To select a subset of the search results, click "Selective Export" button and make a selection of the items you want to export. The amount of items that can be exported at once is similarly restricted as the full export.

    After making a selection, click one of the export format buttons. The amount of items that will be exported is indicated in the bubble next to export format.