Chapter 8: Strategies for Designing Following Routine for Automated Monorail System

1. Reminder, PLEASE! (see U:\MODELING\ASSESSMT\EXPECT\REMINDER.DOC) • Print out the U:\MODELING\ASSESSMT\CHKLST\CHKLST10.DOC and attach it as the cover sheet for your work products. • Circle the appropriate response for each item on the Check List based on YOUR evaluation of YOUR work product for Chapter 10 (i.e., self assess your work). • Attach the originalcheck list and the originalwork product to any resubmitted work products. • ONLY the improvementsrequired,asnoted on the original check list, should be included in resubmitted work products. • Include (or show) the data points on ALL charts constructed in this course; includes lines and curves! • Include a printed copy a representative set of your formulas • Staple your work products • Include your name AND your team number on your work product

2. Resubmitted Work Products(see U:\MODELING\ASSESSMT\EXPECT\REMINDER.DOC) Resubmissions should consist of the following ( in the order specified ! ) : • The original check list with check marks on those items you believe you have improved or corrected. • The improvements you have made to the original work product; ONLY the improvements; NOT a complete, new work product. • The original work product

3. How To Model It : Chapter 8 • Contact Before Work : Teams of 2 or 3 at EACH Computer ( 5 minutes ) [ N.B. Number Off in Teams from 1 to 4 or 5 by FirstLetter of LastName ] • Review Process Check (10minutes ) • Begin With the End in Mind : NEWCompetencies shown in BOLD ( 2 minutes ) • 8.2 - 1 : Assumptions • 8.10 - 1 : Boolean Expressions • 8.7 - 1 : Complexity and Simplification • 8.3 - 3 : Control Heuristics; Problem Solving • 8.3 - 4 : Criteria Required to Make a Decision • 8.10 - 2 : Decision Tables • 8.10 - 3 : Decision Trees • 8.1 - 4 : Documentation ( e.g., Notation ) • 8.10 - 4 : Expert System • 8.10 - 5 : Explanations • 8.4 - 3 : Gordian Knot • 2.1 - 3 : Heuristics ( N.B. keeps appearing ! ) • 8.8 - 4 : Objective or Purpose of Modeling • 8.2 - 2 : Occam’s Razor • 8.5 - 4 : Probability • 8.10 -6 : Production Rules • 8.10 -7 : Qualitative Knowledge • 8.4 - 7 : Results Interpretation • 8.5 - 5 : Risk • 8.9 - 3 : Statistical Distribution • 8.5 - 6 : Stochastic ( Model Types ) • 8.9 - 5 : Subjective (Model Types)

4. How To Model It : Chapter 8 (continued) Structure Before Task • Please CLOSE YOUR BOOKS and PUT THEM AWAY for now; Thank you ! • Each INDIVIDUAL, read the problem statement on the subsequent (10 min ) SLIDES; make notes on questions, anything that needs clarification, etc. ( N.B. Please limit your questions to words you don’t understand, etc.; this is not an opportunity for a discussion of the problem. ) • Clarification, if any ( 2 min ) • Each INDIVIDUAL, read the description of the first task on the (15 min ) subsequent slide; discuss in your SUBteam and follow the directions on the slide. • Reporting out by teams of (10 min ) (1) the REPRESENTATION or MODEL you developed, (2) the list of questions you would like to ask, or (3) the assumptions you would like to make.

5. How To Model It : Chapter 8 (continued) Background :Automated Monorail S&B was recently awarded a contract to develop a software for an automated monorail system. The company needs to design a “following” routine for a cab that can detect at least one other cab on the line ahead of it. This algorithm would accelerate or decelerate a cab depending on its relationship only with the cab immediately in front of it. One possible algorithm is based on the distance to the cab ahead when this distance is greater than a present distance D, the “following” cab is accelerated. Conversely, the cab is decelerated is the distance is less than D. Another algorithm is based on a “speed of approach (S)”. This algorithm decelerates the cab whenever S is positive (the two cabs are moving closer together) and accelerates it when S is negative. The company is hired to investigate the merits and demerits of the two algorithms.

6. How To Model It : Chapter 8 (continued) Your First Task 4 • Take about 15 minutes to • prepare your plan (rememberthinkand plan BEFORE you ‘do’ ), • then come up with a list of strategiesor algorithms or recommendations, NOT questions,that would cover most situations; e.g. Don’t read this book! (N.B. We need to know what strategies are to be made BEFORE we can determine what algorithm we need. • keep the representation or model simple and clarify how you might approach it • Use an overhead transparency to document your results for presentation. • If you find it difficult to develop a list of strategies, then make a list of questions you would like to ask , or assumptions you would like to make, and then prepare your presentation. Remember the heuristic ‘Any answer is better than none’ ! • Some of the heuristicsyou have already met might help you in your search for an appropriate representation.

7. How To Model It : Chapter 8 (continued) Structure Before Task • Break ( N.B. remember the Code of Cooperation, return on time ! ) (10 min ) • Please RETRIEVE and OPEN YOUR BOOKS; Thank you ! • Each INDIVIDUAL, read pp. 132 - 138 (N.B. only TO the 4) and (10 min ) make notes on (1) the strategies or algorithmsand (2)possible improvements to your presentation; then (3) discuss with your SUBteam and check each other for ‘understanding’. • List the information you need to obtain from the user; i.e., a list of (10 min ) questions and possible answers to the questions. • Each INDIVIDUAL, read pp. 138 - 141 (N.B. only TO the 4) (10 min ) • Process Check and Clarifying Expectations ( 6min )

8. Assessment Expectations for Chapter 8 Tasks and Questions That DO Need to be Completed to Meet Expectations for This Chapter • Finish reading the entire chapter and make a list of heuristics found in this chapter which you found useful or believe may be useful in the future. Specifically list or summarize the heuristics found on pp. 138 - 155 in the text. • Complete the following tasks: • Develop a safe distance approach algorithm including charts representing safety, efficiency, and comfort to use in comparing algorithms. Include charts with two cabs and then a line of cabs under the following conditions: (1) cab A travelling at a constant speed (2) cab A moving at a constant speed and then a reduction by one-half the maximum acceleration until cab A comes to a rest (3) cab A travelling with a random component for speed • Develop a safe speed of approach algorithm including charts representing safety, efficiency, and comfort to use in comparing algorithms. Include charts with two cabs and then a line of cabs under the following conditions: (1) cab A travelling at a constant speed (2) cab A moving at a constant speed • INSERT the list of heuristics above and the answers to the questions on the next page in the .TXT file and submit the printed results as the work products for this assignment.

9. Assessment Expectations for Chapter 8 Tasks and Questions That DO Need to be Completed to Meet Expectations for This Chapter (continued) (U:\MODELING\ASSESSMT \...\I_EXPECT.DOC, \EXPCT_8.DOC, and \CKLST_8.DOC) • Submit answers to the questions below. • Determination of sufficient k values based on the initial conditions selected by each individual. • Comment on which methodology is appropriate for the cab control system. • Specifically define and describe the terms ‘Deterministic’, ‘Simulation’, and ‘Modeling’ • Include formulas used in modeling safe distance and safe speed approach.

10. Reminder, PLEASE!(see U:\MODELING\ASSESSMT\EXPECT\E_SKILLS.DOC) Assignment 11 EXCEL Skills Check. • A score of 85.0 is required to Meet Expectations • The Excel Skills Check can be executed repeatedly until the desired score is attained. • Only the highest score attained will be entered into the grade sheet. • The scores must be recorded by 4:00 PM on 25 April 1997 for Friday and 28 April for Mon. session