Voting as validation in robot programming

dc.citation.epage413en_US
dc.citation.issueNumber4en_US
dc.citation.spage401en_US
dc.citation.volumeNumber18en_US
dc.contributor.authorUtete, S. W.en_US
dc.contributor.authorBarshan, B.en_US
dc.contributor.authorAyrulu, B.en_US
dc.date.accessioned2016-02-08T10:41:43Z
dc.date.available2016-02-08T10:41:43Z
dc.date.issued1999-04en_US
dc.departmentDepartment of Electrical and Electronics Engineeringen_US
dc.description.abstractThis paper investigates the use of voting as a conflict-resolution technique for data analysis in robot programming. Voting represents an information-abstraction technique. It is argued that in some cases a voting approach is inherent in the nature of the data being analyzed: where multiple, independent sources of information must be reconciled to give a group decision that reflects a single outcome rather than a consensus average. This study considers an example of target classification using sonar sensors. Physical models of reflections from target primitives that are typical of the indoor environment of a mobile robot are used. Dispersed sensors take decisions on target type, which must then be fused to give the single group classification of the presence or absence and type of a target. Dempster-Shafer evidential reasoning is used to assign a level of belief to each sensor decision. The decisions are then fused by two means. Using Dempster's rule of combination, conflicts are resolved through a group measure expressing dissonance in the sensor views. This evidential approach is contrasted with the resolution of sensor conflict through voting. It is demonstrated that abstraction of the level of belief through voting proves useful in resolving the straightforward conflicts that arise in the classification problem. Conflicts arise where the discriminant data value, an echo amplitude, is most sensitive to noise. Fusion helps to overcome this vulnerability: in Dempster-Shafer reasoning, through the modeling of nonparametric uncertainty and combination of belief values; and in voting, by emphasizing the majority view. The paper gives theoretical and experimental evidence for the use of voting for data abstraction and conflict resolution in areas such as classification, where a strong argument can be made for techniques that emphasize a single outcome rather than an estimated value. Methods for making the vote more strategic are also investigated. The paper addresses the reduction of dimension of sets of decision points or decision makers. Through a consideration of combination/order, queuing criteria for more strategic fusion are identified.en_US
dc.description.provenanceMade available in DSpace on 2016-02-08T10:41:43Z (GMT). No. of bitstreams: 1 bilkent-research-paper.pdf: 70227 bytes, checksum: 26e812c6f5156f83f0e77b261a471b5a (MD5) Previous issue date: 1999en
dc.identifier.doi10.1177/02783649922066277en_US
dc.identifier.issn0278-3649
dc.identifier.urihttp://hdl.handle.net/11693/25255
dc.language.isoEnglishen_US
dc.publisherSage Publications Ltd.en_US
dc.relation.isversionofhttps://doi.org/10.1177/02783649922066277en_US
dc.source.titleInternational Journal of Robotics Researchen_US
dc.subjectDecision theoryen_US
dc.subjectRobot learningen_US
dc.subjectSensor data fusionen_US
dc.subjectSensorsen_US
dc.subjectSonaren_US
dc.subjectUltrasonic transducersen_US
dc.subjectConflict resolutionen_US
dc.subjectDempster-Shafer theoryen_US
dc.subjectEvidential reasoningen_US
dc.subjectRobot programmingen_US
dc.titleVoting as validation in robot programmingen_US
dc.typeArticleen_US

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
Voting as validation in robot programming.pdf
Size:
135.03 KB
Format:
Adobe Portable Document Format
Description:
Full printable version