Pub Date : 1989-11-14DOI: 10.1109/ICSMC.1989.71487
N. Moray, R. Ferrell, H. Stassen, D. Yoerger, W. Rouse, T. Govindaraj, C. Mitchell, P. Sanderson
Presents a review of some of the areas to which supervisory control theory has been applied and indicate some of the ideas which have as yet not been followed up but which were introduced by Sheridan and his students. Topics covered include: modeling manual and supervisory control tasks; supervisory control of deep-ocean vehicles; technology problems and technology solutions; human integration in a complex world; supervisory control in distributed decision-making; and human supervisor control models in advanced manufacturing systems.<>
{"title":"Supervisory control: 30 years and counting","authors":"N. Moray, R. Ferrell, H. Stassen, D. Yoerger, W. Rouse, T. Govindaraj, C. Mitchell, P. Sanderson","doi":"10.1109/ICSMC.1989.71487","DOIUrl":"https://doi.org/10.1109/ICSMC.1989.71487","url":null,"abstract":"Presents a review of some of the areas to which supervisory control theory has been applied and indicate some of the ideas which have as yet not been followed up but which were introduced by Sheridan and his students. Topics covered include: modeling manual and supervisory control tasks; supervisory control of deep-ocean vehicles; technology problems and technology solutions; human integration in a complex world; supervisory control in distributed decision-making; and human supervisor control models in advanced manufacturing systems.<<ETX>>","PeriodicalId":72691,"journal":{"name":"Conference proceedings. IEEE International Conference on Systems, Man, and Cybernetics","volume":"67 1","pages":"1185-1186 vol.3"},"PeriodicalIF":0.0,"publicationDate":"1989-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74124016","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1989-11-14DOI: 10.1109/ICSMC.1989.71432
D. Giusto, C. Regazzoni, G. Vernazza
A knowledge-based vision system called DOORS (Distributed Object-Oriented Recognition System), for obstacle detection and tracking, is presented. It integrates multisensory information sources by adaptively selecting appropriate fusion strategies at the abstraction levels of both physical and virtual sensors. The basic methodology adopted for data representation and processing control has several points in common with object-oriented programming techniques and with blackboard approaches. Some preliminary results are presented for the case of an obstacle moving on a country-road scene.<>
{"title":"Multilevel data-fusion for detection of moving objects","authors":"D. Giusto, C. Regazzoni, G. Vernazza","doi":"10.1109/ICSMC.1989.71432","DOIUrl":"https://doi.org/10.1109/ICSMC.1989.71432","url":null,"abstract":"A knowledge-based vision system called DOORS (Distributed Object-Oriented Recognition System), for obstacle detection and tracking, is presented. It integrates multisensory information sources by adaptively selecting appropriate fusion strategies at the abstraction levels of both physical and virtual sensors. The basic methodology adopted for data representation and processing control has several points in common with object-oriented programming techniques and with blackboard approaches. Some preliminary results are presented for the case of an obstacle moving on a country-road scene.<<ETX>>","PeriodicalId":72691,"journal":{"name":"Conference proceedings. IEEE International Conference on Systems, Man, and Cybernetics","volume":"6 1","pages":"931-933 vol.3"},"PeriodicalIF":0.0,"publicationDate":"1989-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74334006","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1989-11-14DOI: 10.1109/ICSMC.1989.71327
E. Paek, J. Wullert, A. Lehmen, J. S. Patel, A. Scherer, J. Harbison, H. J. Yu, R. Martin
Several experimental demonstrations of neural networks using coherent optics are demonstrated. An associative memory for word-break recognition and a learning machine for multicategory classification are discussed. Finally, a compact and robust coherent optical processor using a recently developed SELDA (surface emitting micro-laser diode array) is described. Although the applications are different, all these implementations are based on the VanderLugt correlator.<>
{"title":"VanderLugt correlator and neural networks","authors":"E. Paek, J. Wullert, A. Lehmen, J. S. Patel, A. Scherer, J. Harbison, H. J. Yu, R. Martin","doi":"10.1109/ICSMC.1989.71327","DOIUrl":"https://doi.org/10.1109/ICSMC.1989.71327","url":null,"abstract":"Several experimental demonstrations of neural networks using coherent optics are demonstrated. An associative memory for word-break recognition and a learning machine for multicategory classification are discussed. Finally, a compact and robust coherent optical processor using a recently developed SELDA (surface emitting micro-laser diode array) is described. Although the applications are different, all these implementations are based on the VanderLugt correlator.<<ETX>>","PeriodicalId":72691,"journal":{"name":"Conference proceedings. IEEE International Conference on Systems, Man, and Cybernetics","volume":"207 1","pages":"408-414 vol.2"},"PeriodicalIF":0.0,"publicationDate":"1989-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75458625","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1989-11-14DOI: 10.1109/ICSMC.1989.71345
H. Kazerooni
In the work presented, extenders are defined as a class of robot manipulators worn by humans to increase human mechanical strength, while the wearer's intellect remains the central control system for manipulating the extender. The human, in physical contact with the extender, exchanges power and information signals with the extender. The author gives a summary of the ongoing research work on human-machine interaction in the sense of the transfer of power and information signals. A single-degree-of-freedom extender has been built for theoretical and experimental verification of the extender dynamics and control. System performance is defined as amplification of human force. It is shown that the greater the required amplification, the smaller the stability range of the system is. A condition for stability of the closed-loop system (extender, human and environment) is derived, and, through both simulation and experimentation, the sufficiency of this condition is demonstrated.<>
{"title":"Stability and performance of human-robot interaction","authors":"H. Kazerooni","doi":"10.1109/ICSMC.1989.71345","DOIUrl":"https://doi.org/10.1109/ICSMC.1989.71345","url":null,"abstract":"In the work presented, extenders are defined as a class of robot manipulators worn by humans to increase human mechanical strength, while the wearer's intellect remains the central control system for manipulating the extender. The human, in physical contact with the extender, exchanges power and information signals with the extender. The author gives a summary of the ongoing research work on human-machine interaction in the sense of the transfer of power and information signals. A single-degree-of-freedom extender has been built for theoretical and experimental verification of the extender dynamics and control. System performance is defined as amplification of human force. It is shown that the greater the required amplification, the smaller the stability range of the system is. A condition for stability of the closed-loop system (extender, human and environment) is derived, and, through both simulation and experimentation, the sufficiency of this condition is demonstrated.<<ETX>>","PeriodicalId":72691,"journal":{"name":"Conference proceedings. IEEE International Conference on Systems, Man, and Cybernetics","volume":"54 8","pages":"494-497 vol.2"},"PeriodicalIF":0.0,"publicationDate":"1989-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/ICSMC.1989.71345","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72404833","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1989-11-14DOI: 10.1109/ICSMC.1989.71244
B. Oommen, J. Lanctôt
The authors consider the problem of a stochastic learning automaton interacting with an unknown random environment. The fundamental problem is that of learning, through interaction, the best action (that is, the action which is rewarded optimally) allowed by the environment. By using running estimates of reward probabilities to learn the optimal action, an extremely efficient pursuit algorithm was obtained by M.A.L. Thathachar et al. (1986, 1989) which is presently among the fastest-growing algorithms known. In the present work, the authors investigate the improvements gained by rendering the pursuit algorithm discrete. This is done by restricting the probability of selecting an action to a finite and, hence, discrete subset of
{"title":"Epsilon-optimal discretized pursuit learning automata","authors":"B. Oommen, J. Lanctôt","doi":"10.1109/ICSMC.1989.71244","DOIUrl":"https://doi.org/10.1109/ICSMC.1989.71244","url":null,"abstract":"The authors consider the problem of a stochastic learning automaton interacting with an unknown random environment. The fundamental problem is that of learning, through interaction, the best action (that is, the action which is rewarded optimally) allowed by the environment. By using running estimates of reward probabilities to learn the optimal action, an extremely efficient pursuit algorithm was obtained by M.A.L. Thathachar et al. (1986, 1989) which is presently among the fastest-growing algorithms known. In the present work, the authors investigate the improvements gained by rendering the pursuit algorithm discrete. This is done by restricting the probability of selecting an action to a finite and, hence, discrete subset of","PeriodicalId":72691,"journal":{"name":"Conference proceedings. IEEE International Conference on Systems, Man, and Cybernetics","volume":"5 1","pages":"6-12 vol.1"},"PeriodicalIF":0.0,"publicationDate":"1989-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91174223","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1989-11-14DOI: 10.1109/ICSMC.1989.71460
K. Yokosawa
A direct character-string retrieval method based on human search characteristics is proposed for Japanese textual image processing. In an experiment in which human subjects were to identify characters shown on a CRT screen, character-string search performance was better than single-character search performance in Japanese sentence contexts. This result suggests that character strings contain more information than characters alone. The analysis of reaction times shows that there are two stages in visual search. A character-string image retrieval system which, human-like, has two stages is effective in searching target images in ninety Japanese textual images. Moreover, human-like performance is obtained from the system: for example, it more easily identifies character-string images than single-character images.<>
{"title":"Human-based character string image retrieval from textual images","authors":"K. Yokosawa","doi":"10.1109/ICSMC.1989.71460","DOIUrl":"https://doi.org/10.1109/ICSMC.1989.71460","url":null,"abstract":"A direct character-string retrieval method based on human search characteristics is proposed for Japanese textual image processing. In an experiment in which human subjects were to identify characters shown on a CRT screen, character-string search performance was better than single-character search performance in Japanese sentence contexts. This result suggests that character strings contain more information than characters alone. The analysis of reaction times shows that there are two stages in visual search. A character-string image retrieval system which, human-like, has two stages is effective in searching target images in ninety Japanese textual images. Moreover, human-like performance is obtained from the system: for example, it more easily identifies character-string images than single-character images.<<ETX>>","PeriodicalId":72691,"journal":{"name":"Conference proceedings. IEEE International Conference on Systems, Man, and Cybernetics","volume":"62 1","pages":"1068-1069 vol.3"},"PeriodicalIF":0.0,"publicationDate":"1989-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84485097","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1989-11-14DOI: 10.1109/ICSMC.1989.71418
J. Hary, Tim P. McCollum, M. J. Darnell, Gene Moore
An experiment was conducted to compare user's performance using a list or graph in tasks which required users to verify statements about relationships between frames. The results showed a response time advantage for the graph that depended on the type of task performed. For tasks which involved simply verifying that a given frame existed or verifying a direct relationship between two frames, use of the list and graph resulted in about equal response time. For tasks which involved verifying indirect relationships between frames, or verifying that a particular frame occurred in a navigational pathway between two other frames, the graph was much faster than the list. The magnitude of the advantage depended on the number of direct relationships that had to be navigated to perform the task; the more the direct relationships that had to be navigated, the greater was the advantage for the graph. These results suggest that the relationships between frames should be presented to users as a graph.<>
{"title":"The usability of lists versus graphs for representing the relationships between frames","authors":"J. Hary, Tim P. McCollum, M. J. Darnell, Gene Moore","doi":"10.1109/ICSMC.1989.71418","DOIUrl":"https://doi.org/10.1109/ICSMC.1989.71418","url":null,"abstract":"An experiment was conducted to compare user's performance using a list or graph in tasks which required users to verify statements about relationships between frames. The results showed a response time advantage for the graph that depended on the type of task performed. For tasks which involved simply verifying that a given frame existed or verifying a direct relationship between two frames, use of the list and graph resulted in about equal response time. For tasks which involved verifying indirect relationships between frames, or verifying that a particular frame occurred in a navigational pathway between two other frames, the graph was much faster than the list. The magnitude of the advantage depended on the number of direct relationships that had to be navigated to perform the task; the more the direct relationships that had to be navigated, the greater was the advantage for the graph. These results suggest that the relationships between frames should be presented to users as a graph.<<ETX>>","PeriodicalId":72691,"journal":{"name":"Conference proceedings. IEEE International Conference on Systems, Man, and Cybernetics","volume":"5 1","pages":"867-871 vol.2"},"PeriodicalIF":0.0,"publicationDate":"1989-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83323831","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1989-11-14DOI: 10.1109/ICSMC.1989.71457
A. Perry, D. Lowe
A method for unsupervised segmentation of textured regions is presented. Rather than identifying boundaries between texture patches, this method detects regions of uniform texture in real images. No a priori knowledge regarding the image, the texture types, or their scales is assumed. The images may contain an unknown number of texture regions including regions with no texture at all. The method is most useful for identifying textures in which sharp intensity changes constitute the most distinctly perceived characteristic. Texture features are computed over image subregions from the distributions of local orientations and the separations of zero-crossing points. The segmentation algorithm establishes the existence of texture regions by finding neighboring subregions that share one or more nonaccidental properties of the computed features, e.g., a distribution of local orientations with a significant peak. Regions' accurate boundaries are identified by extending the seed regions using a region-growing technique that is applied to the computed texture features. The growth is directed by a region-specific self-adaptive thresholding scheme. No assumption is made regarding the texture scale, and the feature analysis is performed across multiple neighborhood (window) sizes. As a result different textures in the image may be segmented using different window sizes.<>
{"title":"Segmentation of nonrandom textures using zero-crossings","authors":"A. Perry, D. Lowe","doi":"10.1109/ICSMC.1989.71457","DOIUrl":"https://doi.org/10.1109/ICSMC.1989.71457","url":null,"abstract":"A method for unsupervised segmentation of textured regions is presented. Rather than identifying boundaries between texture patches, this method detects regions of uniform texture in real images. No a priori knowledge regarding the image, the texture types, or their scales is assumed. The images may contain an unknown number of texture regions including regions with no texture at all. The method is most useful for identifying textures in which sharp intensity changes constitute the most distinctly perceived characteristic. Texture features are computed over image subregions from the distributions of local orientations and the separations of zero-crossing points. The segmentation algorithm establishes the existence of texture regions by finding neighboring subregions that share one or more nonaccidental properties of the computed features, e.g., a distribution of local orientations with a significant peak. Regions' accurate boundaries are identified by extending the seed regions using a region-growing technique that is applied to the computed texture features. The growth is directed by a region-specific self-adaptive thresholding scheme. No assumption is made regarding the texture scale, and the feature analysis is performed across multiple neighborhood (window) sizes. As a result different textures in the image may be segmented using different window sizes.<<ETX>>","PeriodicalId":72691,"journal":{"name":"Conference proceedings. IEEE International Conference on Systems, Man, and Cybernetics","volume":"103 1","pages":"1051-1054 vol.3"},"PeriodicalIF":0.0,"publicationDate":"1989-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83423113","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1989-11-14DOI: 10.1109/ICSMC.1989.71342
A. D. Greenberg
The theoretical basis and the practical architecture are presented for a distributed error monitor (DEM) in an intelligent interface, extended as necessary to provide error tolerance in a multioperator environment. DEM will contain several knowledge-based models: a distributed intent model, an organizational model, a local and distributed task model, a consequence model, and a heuristic model of error forms. The architecture will also include two kinds of dynamic conceptual memory. Finally, an intelligent data network (DN) will communicate distributed situation awareness.<>
{"title":"Distributed error monitoring","authors":"A. D. Greenberg","doi":"10.1109/ICSMC.1989.71342","DOIUrl":"https://doi.org/10.1109/ICSMC.1989.71342","url":null,"abstract":"The theoretical basis and the practical architecture are presented for a distributed error monitor (DEM) in an intelligent interface, extended as necessary to provide error tolerance in a multioperator environment. DEM will contain several knowledge-based models: a distributed intent model, an organizational model, a local and distributed task model, a consequence model, and a heuristic model of error forms. The architecture will also include two kinds of dynamic conceptual memory. Finally, an intelligent data network (DN) will communicate distributed situation awareness.<<ETX>>","PeriodicalId":72691,"journal":{"name":"Conference proceedings. IEEE International Conference on Systems, Man, and Cybernetics","volume":"13 1","pages":"484-488 vol.2"},"PeriodicalIF":0.0,"publicationDate":"1989-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78382835","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1989-11-14DOI: 10.1109/ICSMC.1989.71296
M. F. Hassan, M. I. Younis, M. Sultan
Hierarchical control theory is applied to the problem of management of passengers and luggage in an airport terminal. For this purpose, the airport system is analyzed and a mathematical model representing the dynamics of the controlled sections is proposed. A well-known interaction prediction method is utilized to achieve optimal performance of the system through the minimization of the queue lengths and hence the waiting time of passengers. Simulation results from a case study of Cairo Airport are presented and discussed.<>
{"title":"Management and control of a complex airport terminal","authors":"M. F. Hassan, M. I. Younis, M. Sultan","doi":"10.1109/ICSMC.1989.71296","DOIUrl":"https://doi.org/10.1109/ICSMC.1989.71296","url":null,"abstract":"Hierarchical control theory is applied to the problem of management of passengers and luggage in an airport terminal. For this purpose, the airport system is analyzed and a mathematical model representing the dynamics of the controlled sections is proposed. A well-known interaction prediction method is utilized to achieve optimal performance of the system through the minimization of the queue lengths and hence the waiting time of passengers. Simulation results from a case study of Cairo Airport are presented and discussed.<<ETX>>","PeriodicalId":72691,"journal":{"name":"Conference proceedings. IEEE International Conference on Systems, Man, and Cybernetics","volume":"42 1","pages":"274-279 vol.1"},"PeriodicalIF":0.0,"publicationDate":"1989-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72930066","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：