Welcome
Project Description
Software Development Plan
Gantt Schedule
Specifications Document
Project Proposal
Design Document
Client Email
Teleconference Minutes
Status Reports
Team Meeting Minutes
Client Meeting Minutes
Team Pictures

Specifications Document

TEAM LIVERMORE

Specifications Document

EGR 486 – CSE: Senior Capstone Design

Nathan F. Crary

Aasif Z. Syed

Amy J. Whitaker

Kevin W. Thornton

Date of last revision: November 18, 1997

Revision number: 2.0 kwt

 

 

 

 

Table of Contents

 

 

1. Introduction

 

2. Functional Specifications

2.1 Code Interaction with the Polygonal Terrain Map

 

2.2 Shortest Path Algorithm Involving Costing Functions

 

3. Nonfunctional Specifications

 

 

 

1. Introduction:

 

The Conflict Simulation Lab (CSL) of Lawrence Livermore has a project to construct a

X-window based movement route planner. The route planner will allow a user to select starting and ending positions as well as specific costing functions to use in route generation. Based on the user’s input, the shortest and most cost-effective route will be displayed. This document outlines the specifications of the project based on requirements given by Lawrence Livermore.

 

2. Functional Specifications

Specification

Metric

Value

Unit

2.1.1

Retrieve points from map display

2

Coordinate

pairs

2.1.2a

Display generated route on map display

1

Route

2.1.2b

Store generated route

1+

Files

2.1.3a

Move based on concealment values

98%

Accuracy

2.1.3b

Move based on viewability values

98%

Accuracy

2.1.3c

Move based on time values

98%

Accuracy

2.1.3d

Move based on distance values

98%

Accuracy

2.1.3e

Move based on general area tokens

98%

Accuracy

2.1.4a

Distance and position value precision

.001

Meter

2.1.4b

Angle precision

1

Degree

2.2.1

Shortest path algorithm

Dijkstra’s

Algorithm

2.2.2

Minimum number of Costing Function Sets

1

CFS (BCFS)

2.2.2.1a

Min number of cost functions in CFS

1

Function

2.2.2.1b

Max number of cost functions in CFS

6

Functions

2.2.2.1c

Valid precedence values within CFS

0-1000

Integer

2.2.2.2a

Min radius of ACFS

>0

Meters

2.2.2.2b

Position values for ACFS

Cover any part of

Map

2.2.2.2c

Area of ACFS

Circle

Shape

2.2.2.2d

Costing Function return value normalized (note: this does not include the terrain function)

<= 1

Magnitude

2.2.2.2e

Terrain Costing Function return value

Boolean

Value

       
       
       
       
       

 

 

3. Nonfunctional Specifications

Specification

Metric

Value

Unit

3.1

Must run on

UNIX [Sun/SGI]

Platform

3.2

Must display on

X-Client

Windows

3.3

Coding must be in

C++

Language

3.4a

Must accept input from

1

Mouse

3.4b

Must accept input from

1

Keyboard