Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Kenyon Riddle"'
Autor:
Alex Kirlik, Naira Hovakimyan, Donald A. Talleur, Ronald Carbonari, Kenyon Riddle, Lui Sha, Enric Xargay, Kasey A. Ackerman, Benjamin D. Seefeldt
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a7f3571228b5d7a472488f2664853f90
https://doi.org/10.4324/9781315565712-6
https://doi.org/10.4324/9781315565712-6
Autor:
Jack M. Vice, Gina Hartnett, Linda R. Elliott, Kenyon Riddle, Rodger A. Pettitt, Lisa Baraniecki
Publikováno v:
Human Interface and the Management of Information: Information, Knowledge and Interaction Design ISBN: 9783319585208
HCI (3)
HCI (3)
In this study we explore the concept of gesture-based robot control for maneuver and manipulation, using a prototype system by AnthroTronix [1]. For the task, 24 Soldier-participants were asked to tele-operate the robot through a course containing se
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ca382c1a7d9525ad6a56f78003a6e9d8
https://doi.org/10.1007/978-3-319-58521-5_38
https://doi.org/10.1007/978-3-319-58521-5_38
Autor:
David Bauer, Alex Kirlik, Michael D. Byrne, Donald A. Talleur, Kenyon Riddle, Ronald Carbonari, Bettina L. Beard, Yijing Zhang, Jon Holbrook
Publikováno v:
Proceedings of the Human Factors and Ergonomics Society Annual Meeting. 56:233-237
Three versions of a prototype ground controller interface were tested for their effect on aircraft departure sequencing in a simulation of Dallas/Forth-Worth International Airport. Two versions featured automated decision aids and a third served as a
Autor:
Michael D. Byrne, Amy L. Alexander, Volkan Ustun, Alex Kirlik, Kenyon Riddle, Jeffrey C. Zemla
Publikováno v:
Proceedings of the Human Factors and Ergonomics Society Annual Meeting. 55:831-835
The Next Generation Air Transportation System (NextGen) seeks to reduce gridlock at airports by, among other things, creating a more efficient surface taxi management system. Addressing this situation creates a difficult evaluation problem; how can n