Abstract
An efficient way to notify a set of people is to use a calling tree, where one person calls a few people who call others until everyone has been notified. Calling trees are typical of a large class of planning tasks that entail considering both the structure of agents and tasks in time. Participants were asked to choose the optimal diagram for a calling tree problem, and to compute the time needed to call everyone. Participants computed more accurately when the tree diagrams were scaled to represent elapsed time as well as the connection structure of the callers. In addition to efficiency, both gestalt factors and social equity considerations biased selection of the best diagram.
Original language | English |
---|---|
Pages (from-to) | 277-290 |
Number of pages | 14 |
Journal | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
Volume | 7352 LNAI |
DOIs | |
State | Published - 2012 |
Event | 7th International Conference on the Theory and Application of Diagrams, Diagrams 2012 - Canterbury, United Kingdom Duration: 2 Jul 2012 → 6 Jul 2012 |
Keywords
- comprehension
- diagram understanding
- inference
- planning
- representing time