IEEE Transactions on Systems Man and Cybernetics Part C-Applications and Re最新文献_第9页

An O(N) modular algorithm for the dynamic simulation of robots constrained by a single contact 单接触约束下机器人动态仿真的O(N)模块化算法

IEEE Transactions on Systems Man and Cybernetics Part C-Applications and Re Pub Date : 2002-11-01 DOI: 10.1109/TSMCC.2002.806746

C. S. Bonaventura, K. Jablokow

引用次数: 6

Evolution of digital images 数字图像的演变

IEEE Transactions on Systems Man and Cybernetics Part C-Applications and Re Pub Date : 2002-08-01 DOI: 10.1109/TSMCC.2002.804449

M. Jones, A. Agah

引用次数: 7

Modeling gait transitions of quadrupeds and their generalization with CMAC neural networks 四足动物步态转换的CMAC神经网络建模及其泛化

IEEE Transactions on Systems Man and Cybernetics Part C-Applications and Re Pub Date : 2002-08-01 DOI: 10.1109/TSMCC.2002.804446

J. Lin, Shin-Min Song

{"title":"Modeling gait transitions of quadrupeds and their generalization with CMAC neural networks","authors":"J. Lin, Shin-Min Song","doi":"10.1109/TSMCC.2002.804446","DOIUrl":"https://doi.org/10.1109/TSMCC.2002.804446","url":null,"abstract":"In this paper, two gait transition models of a quadruped are derived based on gait kinematics. The learning and generalization capability of the cerebellar model articulation controller (CMAC) neural network in learning gait transitions is then studied. The two gait transition models are the transition between two general periodic gaits and the transition between a periodic gait and a continuous follow-the-leader (FTL) gait, while maintaining FTL mode during the transition. These models are nonlinear and require either heuristic rules or simultaneous solution of several nonlinear equations. Many transition gaits are then generated by these kinematic gait transition models under various gait conditions and evaluated in terms of stability and smoothness of leg movements. The CMAC neural network is then applied to learn the good transition gaits in four transition conditions: (1) from wave gait to wave gait; (2) from wave gait to FTL gait; (3) from walk to trot; and (4) from trot to transverse gallop. The learning and generalization capability of the trained CMAC neural network is evaluated and found to be satisfactory. This study has demonstrated the potential of applying neural networks to learn walking machine gaits and gait transitions.","PeriodicalId":55005,"journal":{"name":"IEEE Transactions on Systems Man and Cybernetics Part C-Applications and Re","volume":"7 1","pages":"177-189"},"PeriodicalIF":0.0,"publicationDate":"2002-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73147066","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}

引用次数: 17

Characteristics of engineering systems thinking - a 3D approach for curriculum content 工程系统思维的特点——课程内容的三维方法

IEEE Transactions on Systems Man and Cybernetics Part C-Applications and Re Pub Date : 2002-08-01 DOI: 10.1109/TSMCC.2002.804450

M. Frank

引用次数: 63

On the development of a cooperative tutoring environment on computer networks 计算机网络合作教学环境的开发研究

IEEE Transactions on Systems Man and Cybernetics Part C-Applications and Re Pub Date : 2002-08-01 DOI: 10.1109/TSMCC.2002.804451

Gwo-jen Hwang

引用次数: 26

Reliability, validity, and imprecision in fuzzy multicriteria decision-making 模糊多准则决策的信度、效度和不精确性

IEEE Transactions on Systems Man and Cybernetics Part C-Applications and Re Pub Date : 2002-08-01 DOI: 10.1109/TSMCC.2002.804447

T. Boucher, Ozerk Gogus

引用次数: 15

Aggregating evidence in pavement management decision-making using belief functions and qualitative Markov tree 基于信念函数和定性马尔可夫树的路面管理决策证据聚合

IEEE Transactions on Systems Man and Cybernetics Part C-Applications and Re Pub Date : 2002-08-01 DOI: 10.1109/TSMCC.2002.804443

N. Attoh-Okine

{"title":"Aggregating evidence in pavement management decision-making using belief functions and qualitative Markov tree","authors":"N. Attoh-Okine","doi":"10.1109/TSMCC.2002.804443","DOIUrl":"https://doi.org/10.1109/TSMCC.2002.804443","url":null,"abstract":"This paper applies the combined use of qualitative Markov trees and belief functions (otherwise known as Dempster-Shafer theory of evidence), to pavement management decision-making. The basic concepts of the belief function approach-basic probability assignments, belief functions and plausibility functions-are discussed. This paper also discusses the construction of the qualitative Markov tree (join tree). The combined use of the two methods provides a framework for dealing with uncertainty, incomplete data, and imprecise information in the presence of multiple evidences on decision variables. The approach is very appropriate, since it presents more improved methodology and analysis than traditional probability methods applied in pavement management decision-making. Traditional probability theory as a mathematical framework for conceptualizing uncertainty, incomplete data and imprecise information has several shortcomings that have been augmented by several alternative theories. An example is presented to illustrate the construction of qualitative Markov trees, from the evidential network and the solution algorithm. The purpose of the paper is to demonstrate how the evidential network and the qualitative Markov tree can be constructed, and how the propagation of m-values can be handled in the network.","PeriodicalId":55005,"journal":{"name":"IEEE Transactions on Systems Man and Cybernetics Part C-Applications and Re","volume":"44 1","pages":"243-251"},"PeriodicalIF":0.0,"publicationDate":"2002-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90574507","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}

引用次数: 11

A genetic algorithm-based clustering approach for database partitioning 一种基于遗传算法的数据库分区聚类方法

IEEE Transactions on Systems Man and Cybernetics Part C-Applications and Re Pub Date : 2002-08-01 DOI: 10.1109/TSMCC.2002.804444

C. Cheng, W. Lee, Kam-Fai Wong

{"title":"A genetic algorithm-based clustering approach for database partitioning","authors":"C. Cheng, W. Lee, Kam-Fai Wong","doi":"10.1109/TSMCC.2002.804444","DOIUrl":"https://doi.org/10.1109/TSMCC.2002.804444","url":null,"abstract":"In a typical distributed/parallel database system, a request mostly accesses a subset of the entire database. It is, therefore, natural to organize commonly accessed data together and to place them on nearby, preferably the same, machine(s)/site(s). For this reason, data partitioning and data allocation are performance critical issues in distributed database application design. We are dealing with data partitioning. Data partitioning requires the use of clustering. Although many clustering algorithms have been proposed, their performance has not been extensively studied. Moreover, the special problem structure in clustering is rarely exploited. We explore the use of a genetic search-based clustering algorithm for data partitioning to achieve high database retrieval performance. By formulating the underlying problem as a traveling salesman problem (TSP), we can take advantage of this particular structure. Three new operators for GAs are also proposed and experimental results indicate that they outperform other operators in solving the TSP. The proposed GA is applied to solve the data-partitioning problem. Our computational study shows that our GA performs well for this application.","PeriodicalId":55005,"journal":{"name":"IEEE Transactions on Systems Man and Cybernetics Part C-Applications and Re","volume":"20 6 1","pages":"215-230"},"PeriodicalIF":0.0,"publicationDate":"2002-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81308633","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}

引用次数: 117

Gaussian-based edge-detection methods - a survey 基于高斯的边缘检测方法综述

IEEE Transactions on Systems Man and Cybernetics Part C-Applications and Re Pub Date : 2002-08-01 DOI: 10.1109/TSMCC.2002.804448

M. Basu

引用次数: 526

On the behavior-based architectures of autonomous agency 基于行为的自主代理体系结构研究

IEEE Transactions on Systems Man and Cybernetics Part C-Applications and Re Pub Date : 2002-08-01 DOI: 10.1109/TSMCC.2002.804445

A. Mali

{"title":"On the behavior-based architectures of autonomous agency","authors":"A. Mali","doi":"10.1109/TSMCC.2002.804445","DOIUrl":"https://doi.org/10.1109/TSMCC.2002.804445","url":null,"abstract":"A number of autonomous robots with varying degrees of reactive functionality have been built, based on different architectures. We review the foundations, limitations, and achievements of a number of architectures of such autonomous agents from the three categories: (1) reactive; (2) deliberative; and (3) hybrid. Most of these architectures contain behaviors. The principle of avoiding an explicit representation of goals in the purely behavior-based robots has limited their achievements to simple tasks like box pushing, pipe inspection, and navigation. This paper makes two contributions: (1) reviewing autonomous agent architectures and (2) proposing a new class of architectures where behaviors are coupled and/or markers are introduced in environment, without a planner or sequencer and without an explicit representation of goals and investigating tradeoffs in these architectures. We develop a model of behaviors, environmental modification and goals and then show how the behavior-based robots can be made goal-directed. The tradeoffs in increasing their goal directedness are examined. Defining the notion of coupling that captures dependency within the internal structure of a behavior space, it is shown that more complex goals demand higher coupling or more behaviors or a modification to the environment. These novel tradeoffs show a new spectrum of architectures for integrating goals and the behavior-based reactive functionality.","PeriodicalId":55005,"journal":{"name":"IEEE Transactions on Systems Man and Cybernetics Part C-Applications and Re","volume":"23 1","pages":"231-242"},"PeriodicalIF":0.0,"publicationDate":"2002-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82716320","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}

引用次数: 37