931 resultados para burrowing mechanics
Filtro por publicador
- Aberdeen University (2)
- Acceda, el repositorio institucional de la Universidad de Las Palmas de Gran Canaria. España (1)
- AMS Tesi di Dottorato - Alm@DL - Università di Bologna (10)
- AMS Tesi di Laurea - Alm@DL - Università di Bologna (3)
- Applied Math and Science Education Repository - Washington - USA (1)
- Aquatic Commons (2)
- ArchiMeD - Elektronische Publikationen der Universität Mainz - Alemanha (6)
- Aston University Research Archive (50)
- Avian Conservation and Ecology - Eletronic Cientific Hournal - Écologie et conservation des oiseaux: (2)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (9)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP) (2)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (41)
- Brock University, Canada (12)
- Bucknell University Digital Commons - Pensilvania - USA (1)
- Bulgarian Digital Mathematics Library at IMI-BAS (5)
- CaltechTHESIS (14)
- Cambridge University Engineering Department Publications Database (137)
- CentAUR: Central Archive University of Reading - UK (23)
- Chinese Academy of Sciences Institutional Repositories Grid Portal (41)
- Cochin University of Science & Technology (CUSAT), India (6)
- Coffee Science - Universidade Federal de Lavras (1)
- Collection Of Biostatistics Research Archive (1)
- Deakin Research Online - Australia (17)
- Department of Computer Science E-Repository - King's College London, Strand, London (1)
- Digital Commons - Michigan Tech (2)
- Digital Commons at Florida International University (3)
- DigitalCommons - The University of Maine Research (2)
- DRUM (Digital Repository at the University of Maryland) (2)
- Duke University (3)
- eResearch Archive - Queensland Department of Agriculture; Fisheries and Forestry (3)
- Greenwich Academic Literature Archive - UK (22)
- Helda - Digital Repository of University of Helsinki (3)
- Indian Institute of Science - Bangalore - Índia (53)
- Iowa Publications Online (IPO) - State Library, State of Iowa (Iowa), United States (2)
- Lume - Repositório Digital da Universidade Federal do Rio Grande do Sul (1)
- Massachusetts Institute of Technology (3)
- Ministerio de Cultura, Spain (2)
- National Center for Biotechnology Information - NCBI (7)
- Plymouth Marine Science Electronic Archive (PlyMSEA) (15)
- Publishing Network for Geoscientific & Environmental Data (10)
- QSpace: Queen's University - Canada (1)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (16)
- Queensland University of Technology - ePrints Archive (139)
- Repositório Científico da Universidade de Évora - Portugal (1)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (55)
- School of Medicine, Washington University, United States (1)
- Universidad de Alicante (1)
- Universidad Politécnica de Madrid (11)
- Universidade Estadual Paulista "Júlio de Mesquita Filho" (UNESP) (1)
- Université de Lausanne, Switzerland (2)
- Université de Montréal, Canada (2)
- University of Connecticut - USA (2)
- University of Michigan (147)
- University of Queensland eSpace - Australia (22)
- University of Southampton, United Kingdom (4)
- University of Washington (1)
- WestminsterResearch - UK (2)
- Worcester Research and Publications - Worcester Research and Publications - UK (2)
Resumo:
From Pontryagin’s Maximum Principle to the Duke Kahanamoku Aquatic Complex; we develop the theory and generate implementable time efficient trajectories for a test-bed autonomous underwater vehicle (AUV). This paper is the beginning of the journey from theory to implementation. We begin by considering pure motion trajectories and move into a rectangular trajectory which is a concatenation of pure surge and pure sway. These trajectories are tested using our numerical model and demonstrated by our AUV in the pool. In this paper we demonstrate that the above motions are realizable through our method, and we gain confidence in our numerical model. We conclude that using our current techniques, implementation of time efficient trajectories is likely to succeed.