The Trinity College Fire Fighting Home Robot Contest: A Medium For Interdisciplinary Engineering Design
Notice bibliographique
Résumé
Abstract NOTE: The first page of text has been automatically extracted and included below in lieu of an abstract Session 3520 The Trinity College Fire-Fighting Home Robot Contest: A Medium for Interdisciplinary Engineering Design David J. Ahlgren, Jacob E. Mendelssohn Department of Engineering Trinity College, Hartford CT 06106 Introduction In this paper we introduce the Trinity College Fire-fighting Home Robot Contest, describe some of the engineering design problems it presents, and discuss examples of work done at Trinity. Held annually on the Trinity College campus in Hartford, CT since 1995, this is the largest robotics competition in the U.S. open to contestants of any age, affiliation, ability, or experience. The goal of the contest is to stimulate interest in robotics and to encourage invention by persons of all ages. A $1,000 first prize is awarded in both the junior division (high school and younger) and the senior division (all others). The contest was expanded in 1998 to include affiliated regional events that use the Trinity College rules; at this writing, events are scheduled in Fort Worth, Calgary, and Seattle. Winners from the regional contests will compete in the final event, held at Trinity on April 19, 1998. Participation engages engineering students and professionals in a motivating, open-ended interdisciplinary project. Design of a fire-fighting mobile robot is a challenge that is appropriate, for example, as a senior engineering design project. The object is to develop a computer-controlled, autonomous machine that can navigate through a 8 ft. by 8 ft. maze, find a fire (a lit candle), and extinguish it in minimum time. The robot must operate without human intervention; radio control and joystick control are not permitted. The walls of the maze (painted white) are 13" high, the hallways are 18" wide, and the floor is flat black. Thus the robot simulates the real-world operation of a robot performing a fire-security operation in a single-story home. The maze geometry, which is known beforehand by the contestants, includes four rooms and connecting hallways. The robot does not know where the fire is located, and the fire can be in any of the rooms. Before extinguishing the flame, the robot must navigate to within 12" of it and show that it has recognized the flame. Each robot makes three runs, which begin at a designated starting spot. The score is the sum of the fastest two run times, multiplied by reduction factors for: 1) reliability (success on all three runs); 2) obstacle avoidance ability; 3) ability to return to the starting spot after extinguishing the candle; and 4) ability to trigger the robot's run using a 3.5 KHz tone that simulates a smoke alarm. The 1998 contest encourages the development of robots that do not rely on dead reckoning. Robots will receive a deduction for succeeding when ramps, which add uncertainty about path lengths, are placed in the maze.1 Engineering Design Problems Development of a fire-fighting mobile robot is a constrained optimization problem that can be 1 Full contest rules are found at the Web address: http://www.trincoll.edu/~robot.
Récupéré en direct depuis OpenAlex et désinversé. Les résumés ne sont pas conservés dans cette base de données : les index inversés représentent 8,6 Go des 9,3 Go de texte de la base, et le serveur dispose de 13 Go libres.
Comment cette classification a été obtenuedéplier
Prédiction machine sur la base complète
Imitation des enseignantsNi prévalence calibrée, ni vérité terrain. Validation humaine à venir. Le volet Gemma est une étiquette directe du modèle pour chaque travail de la base, lue sur la notice réduite au titre. Le volet Codex est un classifieur appris des 10 348 étiquettes directes de Codex et calibré sur les taux pondérés de l'échantillon; les champs sans appui suffisant ne portent aucun appel Codex. Le mode candidate est l'union des deux volets; le consensus est leur intersection. Ces sorties portent le statut machine_predicted_unvalidated et ne sont pas des étiquettes humaines.
Scores du classifieur distillé par catégorie (deux têtes)
| Catégorie | Codex | Gemma |
|---|---|---|
| Métarecherche | 0,004 | 0,008 |
| Méta-épidémiologie (sens strict) | 0,001 | 0,000 |
| Méta-épidémiologie (sens large) | 0,000 | 0,001 |
| Bibliométrie | 0,002 | 0,001 |
| Études des sciences et des technologies | 0,003 | 0,001 |
| Communication savante | 0,006 | 0,003 |
| Science ouverte | 0,002 | 0,007 |
| Intégrité de la recherche | 0,001 | 0,002 |
| Charge utile insuffisante (le modèle a refusé de juger) | 0,104 | 0,017 |
Scores machine (provisoires)
Les deux têtes enseignantes du modèle étudiant, lues sur ce travail. Un score ordonne la base pour la relecture; il n'affirme jamais une catégorie, et le statut de validation accompagne chaque rangée tel quel.
Scores de référence d'un modèle non mature (critères de maturité non atteints, 7 itérations). Un score ordonne; il n'affirme jamais une catégorie.
score_only:v0-immature-baseline · tel quel depuis la passe de notation : score_only signifie que le nombre peut ordonner les travaux, et qu'aucune étiquette de catégorie n'en découleClassification
machine, non validéePrédiction automatique; un appel candidat d’une seule source (Gemma direct ou Codex distillé), pas un consensus.
Le détail, modèle par modèle et score par score, se trouve en fin de page sous « Comment cette classification a été obtenue ».