Lecture 23 Logistics Last lecture Today HW7 due Friday Lab8 going on

Slides:



Advertisements
Similar presentations
(Synchronous) Finite State Machines
Advertisements

Lab 2: Finite State Machines CS 3410 Spring 2015.
Robot Programming. Programming Behaviors Behaviors describe the actions and decisions of your robot.
CS 151 Digital Systems Design Lecture 25 State Reduction and Assignment.
Introduction to CMOS VLSI Design Lecture 14: CAMs, ROMs, and PLAs Credits: David Harris Harvey Mudd College (Material taken/adapted from Harris’ lecture.
CAMs, ROMs, and PLAs. 2 Outline  Content-Addressable Memories  Read-Only Memories  Programmable Logic Arrays.
Give qualifications of instructors: DAP
Lecture 20: CAMs, ROMs, PLAs. CMOS VLSI DesignCMOS VLSI Design 4th Ed. 20: CAMs, ROMs, and PLAs2 Outline  Content-Addressable Memories  Read-Only Memories.
ECE 301 – Digital Electronics Introduction to Sequential Logic Circuits (aka. Finite State Machines) and FSM Analysis (Lecture #17)
ECE 331 – Digital Systems Design Introduction to Sequential Logic Circuits (aka. Finite State Machines) and FSM Analysis (Lecture #19)
ENGIN112 L25: State Reduction and Assignment October 31, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 25 State Reduction and Assignment.
Lecture 18 More Moore/Mealy machines.
Announcements Assignment 8 posted –Due Friday Dec 2 nd. A bit longer than others. Project progress? Dates –Thursday 12/1 review lecture –Tuesday 12/6 project.
State Machines The first problem set is now online! (Due on Jan. 31st, 2011)
1 CSE370, Lecture 18 Lecture 20 u Logistics n HW6 due Wednesday n Lab 7 this week (Tuesday exception) n Midterm 2 Friday (covers material up to simple.
Digital Logic Design Lecture # 19 University of Tehran.
DLD Lecture 26 Finite State Machine Design Procedure.
1 CSE370, Lecture 24 Lecture 26 u Logistics n HW8 due Friday n Ant extra credit due Friday n Final exam a week from today, 12/8 8:30am-10:20am here n Review.
The Corridor Challenge

Introduction to CMOS VLSI Design Lecture 14: CAMs, ROMs, and PLAs
Finite state machine optimization
ECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN
Finite state machine optimization
Introduction to CMOS VLSI Design Lecture 14: CAMs, ROMs, and PLAs
Lecture 28 Logistics Today
Lecture 26 Logistics Last lecture Today HW8 due Friday
Lecture 27 Logistics Last lecture Today: HW8 due Friday
Digital Design Lecture 9
Typical Timing Specifications
Lecture 23 Logistics Last lecture Today HW7 due Friday Lab8 going on
Lecture 27 Logistics Last lecture Today: HW8 due Friday
CSE 140L Discussion Finite State Machines.
Hakim Weatherspoon CS 3410 Computer Science Cornell University
Lecture 28 Logistics Today
Extra credit (worth 10pts equivalent in a midterm)
Lecture 21 Logistics Today
CSE 370 – Winter Sequential Logic-2 - 1
Lecture 25 Logistics Last lecture Today HW8 posted today, due 12/5
Lecture 15 Logistics Last lecture Today HW4 is due today
Lecture 7 Logistics Last lecture Today HW2 due now Lab2 going on
Lecture 24 Logistics Last lecture Today HW7 due today
Extra credit (worth 10pts equivalent in a midterm)
Lecture 17 Logistics Last lecture Today HW5 due on Wednesday
Lecture 9 Logistics Last lecture Last last lecture Today
Lecture 25 Logistics Last lecture Today HW8 posted today, due 12/5
Which way does the robot have to turn to get to the charger?
Lecture 21 Logistics Last lecture Today HW7 due Wednesday
CSE 370 – Winter Sequential Logic-2 - 1
Lecture 24 Logistics Last lecture Today HW7 back today
Lecture 24 Logistics Last lecture Today HW7 due today
Lecture 22 Logistics Last lecture Today
Guest Lecture by David Johnston
Lecture 20 Logistics Last lecture Today Graded HW back today
Lecture 20 Logistics Last lecture Today HW6 due Wednesday
Lecture 23 Logistics Last lecture Today HW8 due Wednesday, March 11
Lecture 17 Logistics Last lecture Today HW5 due on Wednesday
Instructor: Alexander Stoytchev
Lecture 18 Logistics Last Lecture Today HW6 due today Midterm 2
Lecture 18 Logistics Last lecture Today HW5 due today (with extra 10%)
Lecture 22 Logistics Last lecture Today HW7 is due on Friday
Lecture 7 Logistics Last lecture Today HW2 due now Lab2 going on
Lecture 20: CAMs, ROMs, PLAs
Lecture 22 Logistics Last lecture Today HW7 is due on Friday
ECE 352 Digital System Fundamentals
Announcements Assignment 7 due now or tommorrow Assignment 8 posted
CSE 370 – Winter Sequential Logic-2 - 1
Lecture 19 A bigger FSM example: Hungry Robot Ant in Maze.
Introduction to CMOS VLSI Design Lecture 18: CAMs, ROMs, and PLAs
Presentation transcript:

Lecture 23 Logistics Last lecture Today HW7 due Friday Lab8 going on Moore and Mealy machines Today A bigger FSM example: Hungry Robot Ant in Maze 23

The “WHY” slide Bigger FSM example Many things in the world are finite state machines (are we humans?) and most of them are far bigger and more complex than the examples we had so far. It is good to be able to understand and solve for a project-level FSM problem that’s a lot more realistic to FSMs that you may design in industry or in grad school. 23

Robotic ant in a maze Robot ant, physical maze Maze has no islands Corridors are wider than ant Design the robotic ant’s brain to get to the food! Food! start 23

Robot ant specifics Sensors: L and R antennae, 1 if touching wall Actuators: F - forward step, TL/TR - turn left/right Goal: find way out of maze to get to food. Strategy: keep the wall on the right 23

Example: ant brain (special case 1) Left (L) Antenna touching the wall 23

Example: ant brain (special case 2) Ant Lost 23

Example: ant brain (special case 2) Ant Lost (another example) 23

Robot Ant behavior A: Following wall, touching Go forward, turning left slightly B: Following wall, not touching Go forward, turning right slightly D: Hit wall again Back to state A C: Break in wall Go forward, turning right slightly E: Wall in front Turn left until... F: ...we are here, same as state B G: Turn left until... LOST: Forward until we touch something 23

Notes & strategy Notes Strategy Maze has no islands Corridors are wider than ant Don’t worry about startup Assume a Moore machine Assume D flip-flops Strategy Keep the wall on the right 23

Design the ant-brain FSM State diagram State-transition table 3. State minimization 4. State encoding 5. Next-state logic minimization 6. Implement the design 23

Notations Sensors on L and R antennae Movement Sensor = “1” if touching wall; “0” if not touching wall L'R'  no wall L'R  wall on right LR'  wall on left LR  wall in front Movement F  forward one step TL  turn left slightly TR  turn right slightly 23

1. State Diagram R L + R L’ R LOST (F) L’ R’ E/G (TL) L L’ R A/D (TL, F) L L’ R’ B/F (TR, F) L’ R’ R L C (TR, F) L’ R’ L’ R’ L 23