Filtering by
- All Subjects: robotics
- Creators: Computer Science and Engineering Program
- Creators: Marvi, Hamidreza
- Member of: Barrett, The Honors College Thesis/Creative Project Collection
Robots are often used in long-duration scenarios, such as on the surface of Mars,where they may need to adapt to environmental changes. Typically, robots have been built specifically for single tasks, such as moving boxes in a warehouse or surveying construction sites. However, there is a modern trend away from human hand-engineering and toward robot learning. To this end, the ideal robot is not engineered,but automatically designed for a specific task. This thesis focuses on robots which learn path-planning algorithms for specific environments. Learning is accomplished via genetic programming. Path-planners are represented as Python code, which is optimized via Pareto evolution. These planners are encouraged to explore curiously and efficiently. This research asks the questions: “How can robots exhibit life-long learning where they adapt to changing environments in a robust way?”, and “How can robots learn to be curious?”.
To achieve this goal, a model of a swarm performing a collective transport task in a bounded domain featuring convex obstacles was simulated in MATLAB/ Simulink®. The closed-loop dynamic equations of this model were linearized about an equilibrium state with angular acceleration and linear acceleration set to zero. The simulation was run over 30 times to confirm system ability to successfully transport the payload to a goal point without colliding with obstacles and determine ideal operating conditions by testing various orientations of objects in the bounded domain. An additional purely MATLAB simulation was run to identify local minima of the Hessian of the navigation-like potential function. By calculating this Hessian periodically throughout the system’s progress and determining the signs of its eigenvalues, a system could check whether it is trapped in a local minimum, and potentially dislodge itself through implementation of a stochastic term in the robot controllers. The eigenvalues of the Hessian calculated in this research suggested the model local minima were degenerate, indicating an error in the mathematical model for this system, which likely incurred during linearization of this highly nonlinear system.
Planning coordination between robots in a multi-agent system requires each robot to know the position of the other robots. To address this, the localization server tracked visual fiducial markers attached to the robots and relayed their pose to every robot at a rate of 20Hz using the MQTT communication protocol. The robots used this data to inform a potential fields path planning algorithm and navigate to their target position.
This project was unable to address all of the challenges facing true distributed multi-agent coordination and needed to make concessions in order to meet deadlines. Further research would focus on shoring up these deficiencies and developing a more robust system.
the application of deep learning and planning techniques, with the aim of constructing generalized plans capable of solving multiple problem instances. We construct a Deep Neural Network that, given an abstract problem state, predicts both (i) the best action to be taken from that state and (ii) the generalized “role” of the object being manipulated. The neural network was tested on two classical planning domains: the blocks world domain and the logistic domain. Results indicate that neural networks are capable of making such
predictions with high accuracy, indicating a promising new framework for approaching generalized planning problems.