dc.contributor.author |
Hammoud, Bilal Abdel Nasser, |
dc.date.accessioned |
2017-08-30T14:29:12Z |
dc.date.available |
2017-08-30T14:29:12Z |
dc.date.issued |
2016 |
dc.date.submitted |
2016 |
dc.identifier.other |
b19028556 |
dc.identifier.uri |
http://hdl.handle.net/10938/11150 |
dc.description |
Thesis. M.E. American University of Beirut. Department of Mechanical Engineering, 2016. ET:6517 |
dc.description |
Advisor : Dr. Elie Shammas, Assistant Professor, Mechanical Engineering ; Members of Committee : Dr. Daniel Asmar, Associate Professor, Mechanical Engineering ; Dr. Imad Elhajj, Associate Professor, Electrical and Computer Engineering. |
dc.description |
Includes bibliographical references (leaves 55-58) |
dc.description.abstract |
For a system to be completely autonomous, many subsystems need to interact and ensure that the system executes the required tasks without any human intervention or guidance. One subsystem that computes the trajectory which an autonomous agent should traverse while going from an initial configuration to a predetermined final configuration is an essential part to ensure complete autonomy. Solving the path planning problem is a major research area in the field of autonomous robotics. Researchers tend to use simplified kinematic models to obtain solutions, frequently analytic, for the planned trajectories of autonomous agents. This thesis introduces a new kinematic model to describe the planar motion of an Autonomous Underwater Vehicle (AUV) moving in constant current flows. The AUV is modeled as a rigid body moving at maximum attainable forward velocity with symmetric bounds on the control input for the turning rate. The model incorporates the effect a flow will induce on the turning rate of the AUV due to the non-symmetric geometry of the vehicle. The model is then used to characterize and construct the minimum time paths that take the AUV from a given initial configuration to a final configuration in the plane. Two algorithms for the time-optimal path synthesis problem are also introduced along with several simulations to validate the proposed method. After that the assumption of maximum forward velocity is relaxed. Then a new type of paths is investigated. The trajectories computed allow the system to travel between two predetermined configurations while minimizing the total power consumption. Finally, the results are obtained numerically and geometric interpretations are presented. |
dc.format.extent |
1 online resource (xii, 58 leaves) : color illustrations |
dc.language.iso |
eng |
dc.relation.ispartof |
Theses, Dissertations, and Projects |
dc.subject.classification |
ET:006517 |
dc.subject.lcsh |
Mobile robots |
dc.subject.lcsh |
Autonomous robots. |
dc.subject.lcsh |
Holonomy groups. |
dc.subject.lcsh |
Kinematics. |
dc.subject.lcsh |
Mathematical optimization. |
dc.title |
Optimal path planning for a class of nonholonomic systems with drift - |
dc.type |
Thesis |
dc.contributor.department |
Faculty of Engineering and Architecture. |
dc.contributor.department |
Department of Mechanical Engineering, |
dc.contributor.institution |
American University of Beirut. |