2 resultados para Repeated Fragments
em QSpace: Queen's University - Canada
Resumo:
In this project we review the effects of reputation within the context of game theory. This is done through a study of two key papers. First, we examine a paper from Fudenberg and Levine: Reputation and Equilibrium Selection in Games with a Patient Player (1989). We add to this a review Gossner’s Simple Bounds on the Value of a Reputation (2011). We look specifically at scenarios in which a long-run player faces a series of short-run opponents, and how the former may develop a reputation. In turn, we show how reputation leads directly to both lower and upper bounds on the long-run player’s payoffs.
Resumo:
This paper presents a solution to part of the problem of making robotic or semi-robotic digging equipment less dependant on human supervision. A method is described for identifying rocks of a certain size that may affect digging efficiency or require special handling. The process involves three main steps. First, by using range and intensity data from a time-of-flight (TOF) camera, a feature descriptor is used to rank points and separate regions surrounding high scoring points. This allows a wide range of rocks to be recognized because features can represent a whole or just part of a rock. Second, these points are filtered to extract only points thought to belong to the large object. Finally, a check is carried out to verify that the resultant point cloud actually represents a rock. Results are presented from field testing on piles of fragmented rock. Note to Practitioners—This paper presents an algorithm to identify large boulders in a pile of broken rock as a step towards an autonomous mining dig planner. In mining, piles of broken rock can contain large fragments that may need to be specially handled. To assess rock piles for excavation, we make use of a TOF camera that does not rely on external lighting to generate a point cloud of the rock pile. We then segment large boulders from its surface by using a novel feature descriptor and distinguish between real and false boulder candidates. Preliminary field experiments show promising results with the algorithm performing nearly as well as human test subjects.