Zeyi worked on integration this week and improving the user interface. He changed the map to have multiple items on a single node to help the product become more robust. He also changed the node list and item list to display the remaining nodes and items on the planed route. Overall, he has more descriptive changes on his personal update. Zehong further improved his algorithm and further integrated with Zeyi’s user interface. There were some bugs when integrating, and Zehong…
This week I majorly worked in integrating my path planning algorithm with Zeyi’s user interface. In the process, we identified some bugs with the algorithm and I fixed them. First bug was with the replan() function. I ended up referencing some local variable that only existed in my version of the path planning algorithm (duplicate variable names in testing code). This created a problem on Zeyi’s side where replan() only works for certain pairs of nodes. It was a rather…
Changed the map of the shopping to the form of “multiple items on a single node”. Formatted the interface’s cart-guiding page by adding a picture of the map to it. Changed the Node List and Item List to display the remaining nodes and items on the planned route. Implemented all functions of the simulation buttons. To-do: further revise the look of the pages testing the interface for bug
Finished Integrating the user interface with the algorithm for the final demo. Added buttons for simulations of finding obstacles, and implemented functions of skipping and placing items. Next step: Furnishing the cart tracking page for the final presentation, seperate the simulation and tracking components.
This week, integration was the main theme for our group. We also had some individual tasks we had to do to help smoothen the integration. Carlo’s focused on integrating the range sensor code with Zeyi and Zehong’s work. He also focused on altering the design to improve the feasibility of the sensors. Finally, he has been preparing for the demo and methods to present the sensors in the presentation. To get a more detailed description, please read his weekly update….
This week, I first addressed the problem with local re-planning. I was thinking if an obstacle were to appear in the optimal route between Node1 and Node2, I can simple recall the saved shortest path between Node1 and Node2 that has been pre-planned to “go around” the obstacle. But I soon realized that due to the way my algorithm is set up, every pair of adjacent nodes in the optimal route are neighbors. This leads to a problem that if…
This week I worked on setting up the demo and integrating the range sensor code with Zeyi and Zehong’s pipelines. I also worked on the viability of altering our design to include two forward facing range sensors. To measure the viability of altering our design to include 2 forward facing sensors, I decided to create a model of what a single range sensor is capable of doing. This involved doing the trigonometry to solve for the distance of the field…
Zehong mainly worked on updating the algorithm further to add additional details. The algorithm now can start and end at different nodes. This helps decrease the limitations of the algorithm. In addition, Zehong focused on generating maps this week to help showcase exactly what is going on. He then ran multiple tests to make sure he is accounting for all possible scenarios. For more detailed descriptions, please read his update. Zeyi continued on improving the user interface and the additional…
Updated some features of the user interface’s second page. Added a button for the user to skip the current item. Implemented the feature that the user would be notified when the cart arrives at the current item, and an event loop that simulates the process that the cart travels on the map. The next step of the user interface part will be integrating with the path planning algorithm and refining the look of the interface.
After talking with professor during the last meeting, I first updated the algorithm so that it can start and end of different nodes. I then embarked on testing the limits of my algorithm. To do that, I first need to generate maps of my own. I first randomly generate the x and y coordinates of n nodes. The weight(distance) of edge between each pair of nodes is always the euclidean distance. I chose this to be the distance to avoid problems…