![]() The choice of one or the other form is made in a graphic menu. Generated randomly by the program (sparse number of objects).In the final implementation, the configuration of obstacles in the room is done in two ways: There is a current charge indicator light that changes color when charging, when the battery is running out and when the battery is full. It will pause the service to return to the docstation and charge the battery (the battery is super-fast charging, taking the same 2 seconds). The robot has a battery that must be charged after traveling twice the area of the room. As in the first implementation, cleaning at these points should cover about twice the area of the robot. ![]() At the end the user defines some dirt points (given by mouse clicks). The robot cleans the entire room in a back and forth motion. After the cleaning process the point disappears Second Implementation: ![]() The robot leaves the dockstation and goes to that point to clean it.Ĭleaning should cover about twice the area of the robot, with the point being clicked in the center of the area to be cleaned. The user can click anywhere in the graphic environment where the dirt must be removed. In any of the implementations the robot avoids obstacles and never get's out of the window. In the end of each implementation the program always return to the menu. The various implementations are called in a starting menu and where the program can be closed too. ![]() Zelle, Franklin, Beedle & Associates, 2017. The program must use the graphics library provided by authors of the book: Python Programming: An Introduction to Computer Science, 3rd Ed., John M. Programming will be incremental, starting with a simple project, increasing the difficulty. This robot cleans the floor in a given area. The program aims to simulate a robotic vacuum cleaner (omnidirectional service robot). ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |