In this paper, a hybrid method based on rough sets and genetic algorithms, is proposed to improve the speed of robot path planning. Decision rules are obtained using rough set theory. A series of available paths are p...In this paper, a hybrid method based on rough sets and genetic algorithms, is proposed to improve the speed of robot path planning. Decision rules are obtained using rough set theory. A series of available paths are produced by training obtained minimal decision rules. Path populations are optimised by using genetic algorithms until the best path is obtained. Experiment results show that this hybrid method is capable of improving robot path planning speed.展开更多
Reducing casualties and property losses through effective evacuation route planning has been a key focus for researchers in recent years.As part of this effort,an enhanced sparrow search algorithm(MSSA)was proposed.Fi...Reducing casualties and property losses through effective evacuation route planning has been a key focus for researchers in recent years.As part of this effort,an enhanced sparrow search algorithm(MSSA)was proposed.Firstly,the Golden Sine algorithm and a nonlinear weight factor optimization strategy were added in the discoverer position update stage of the SSA algorithm.Secondly,the Cauchy-Gaussian perturbation was applied to the optimal position of the SSA algorithm to improve its ability to jump out of local optima.Finally,the local search mechanism based on the mountain climbing method was incorporated into the local search stage of the SSA algorithm,improving its local search ability.To evaluate the effectiveness of the proposed algorithm,the Whale Algorithm,Gray Wolf Algorithm,Improved Gray Wolf Algorithm,Sparrow Search Algorithm,and MSSA Algorithm were employed to solve various test functions.The accuracy and convergence speed of each algorithm were then compared and analyzed.The results indicate that the MSSA algorithm has superior solving ability and stability compared to other algorithms.To further validate the enhanced algorithm’s capabilities for path planning,evacuation experiments were conducted using different maps featuring various obstacle types.Additionally,a multi-exit evacuation scenario was constructed according to the actual building environment of a teaching building.Both the sparrow search algorithm and MSSA algorithm were employed in the simulation experiment for multiexit evacuation path planning.The findings demonstrate that the MSSA algorithm outperforms the comparison algorithm,showcasing its greater advantages and higher application potential.展开更多
Green transformation is an unavoidable choice for resource-based cities(RBCs)that face resource depletion and environmental pollution.Existing research has focused primarily on specific RBCs,making it challenging to a...Green transformation is an unavoidable choice for resource-based cities(RBCs)that face resource depletion and environmental pollution.Existing research has focused primarily on specific RBCs,making it challenging to apply green transformation strategies universally across cities.The fuzzy set qualitative comparative analysis(fsQCA)is a combination of qualitative and quantitative analyses that can handle multiple concurrent causality problems and determine how different conditions combine into configurations and generate an outcome.Thus,to address this gap,in this study,we established a research framework for green transformation and utilized the fsQCA to examine the configurations of 113 RBCs in China.By incorporating the element of time,this study explored the dynamic evolution of solutions in 2013,2016,and 2019.The main findings indicate that individual elements do not constitute the necessary conditions for improving the green transformation efficiency(GTE),and the systematic combination of multiple conditions is an effective path for realizing the improvement of the GTE in RBCs.Green transformation paths of RBCs exhibit the same destination through different paths.Additionally,the combination of system environment elements and system structure elements is both complementary and alternative.Differences in RBCs have led to various factor combinations and development paths,but there are some similarities in the key elements of the factor combinations at different stages.Economic environment,government support,and technological innovation are key factors that universally enhance the GTE in RBCs.These insights can assist city managers in formulating policies to drive green transformation and contribute to a better theoretical understanding of green transformation paths in RBCs.展开更多
Overlapping community detection in a network is a challenging issue which attracts lots of attention in recent years.A notion of hesitant node(HN) is proposed. An HN contacts with multiple communities while the comm...Overlapping community detection in a network is a challenging issue which attracts lots of attention in recent years.A notion of hesitant node(HN) is proposed. An HN contacts with multiple communities while the communications are not strong or even accidental, thus the HN holds an implicit community structure.However, HNs are not rare in the real world network. It is important to identify them because they can be efficient hubs which form the overlapping portions of communities or simple attached nodes to some communities. Current approaches have difficulties in identifying and clustering HNs. A density-based rough set model(DBRSM) is proposed by combining the virtue of densitybased algorithms and rough set models. It incorporates the macro perspective of the community structure of the whole network and the micro perspective of the local information held by HNs, which would facilitate the further "growth" of HNs in community. We offer a theoretical support for this model from the point of strength of the trust path. The experiments on the real-world and synthetic datasets show the practical significance of analyzing and clustering the HNs based on DBRSM. Besides, the clustering based on DBRSM promotes the modularity optimization.展开更多
Changes in requirements may result in the increasing of product development project cost and lead time, therefore, it is important to understand how require- ment changes propagate in the design of complex product sys...Changes in requirements may result in the increasing of product development project cost and lead time, therefore, it is important to understand how require- ment changes propagate in the design of complex product systems and be able to select best options to guide design. Currently, a most approach for design change is lack of take the multi-disciplinary coupling relationships and the number of parameters into account integrally. A new design change model is presented to systematically analyze and search change propagation paths. Firstly, a PDS-Be- havior-Structure-based design change model is established to describe requirement changes causing the design change propagation in behavior and structure domains. Secondly, a multi-disciplinary oriented behavior matrix is utilized to support change propagation analysis of complex product systems, and the interaction relationships of the matrix elements are used to obtain an initial set of change paths. Finally, a rough set-based propagation space reducing tool is developed to assist in narrowing change propagation paths by computing the importance of the design change parameters. The proposed new design change model and its associated tools have been demonstrated by the scheduling change propagation paths of high speed train's bogie to show its feasibility and effectiveness. This model is not only supportive to response quickly to diversified market requirements, but also helpful to satisfy customer require- ments and reduce product development lead time. The proposed new design change model can be applied in a wide range of engineering systems design with improved efficiency.展开更多
By means of Logic symmetric relation,the single neighboring Logic path for Ndimensions Boolean ordered set is solved.A new method of determining any logic neighboringsubset in limited dimension is proposed.Its results...By means of Logic symmetric relation,the single neighboring Logic path for Ndimensions Boolean ordered set is solved.A new method of determining any logic neighboringsubset in limited dimension is proposed.Its results are intuitional and realizable for computer.展开更多
Path planning is a key technique of autonomous navigation for robots,and the velocity field is an important part.Constructing velocity field in a complex workspace is still challenging.In this paper,an inner normal gu...Path planning is a key technique of autonomous navigation for robots,and the velocity field is an important part.Constructing velocity field in a complex workspace is still challenging.In this paper,an inner normal guided segmentation algorithm in a complex polygon is proposed to decompose the complex workspace in this paper.The artificial potential field model based on probability theory is then used to calculate the potential field of the decomposed workspace,and the velocity field is obtained by utilizing the potential field of this workspace.Path optimization is implemented by curve evolution,during which the internal force generated in the smoothing process of the initial path by a mean filter and the external force is obtained from the gradient of the workspace potential field.The parameter selection principle is deduced by analyzing the influence of several parameters on the path length and smoothness.Simulation results show that the designed polygon decomposition algorithm can effectively segment complex workspace and that the path optimization algorithm can shorten and smoothen paths.展开更多
基金This project is partially supported by Science Research Funding from the Education Department of Liaoning Province, China (No.J9906065).
文摘In this paper, a hybrid method based on rough sets and genetic algorithms, is proposed to improve the speed of robot path planning. Decision rules are obtained using rough set theory. A series of available paths are produced by training obtained minimal decision rules. Path populations are optimised by using genetic algorithms until the best path is obtained. Experiment results show that this hybrid method is capable of improving robot path planning speed.
基金supported by National Natural Science Foundation of China(71904006)Henan Province Key R&D Special Project(231111322200)+1 种基金the Science and Technology Research Plan of Henan Province(232102320043,232102320232,232102320046)the Natural Science Foundation of Henan(232300420317,232300420314).
文摘Reducing casualties and property losses through effective evacuation route planning has been a key focus for researchers in recent years.As part of this effort,an enhanced sparrow search algorithm(MSSA)was proposed.Firstly,the Golden Sine algorithm and a nonlinear weight factor optimization strategy were added in the discoverer position update stage of the SSA algorithm.Secondly,the Cauchy-Gaussian perturbation was applied to the optimal position of the SSA algorithm to improve its ability to jump out of local optima.Finally,the local search mechanism based on the mountain climbing method was incorporated into the local search stage of the SSA algorithm,improving its local search ability.To evaluate the effectiveness of the proposed algorithm,the Whale Algorithm,Gray Wolf Algorithm,Improved Gray Wolf Algorithm,Sparrow Search Algorithm,and MSSA Algorithm were employed to solve various test functions.The accuracy and convergence speed of each algorithm were then compared and analyzed.The results indicate that the MSSA algorithm has superior solving ability and stability compared to other algorithms.To further validate the enhanced algorithm’s capabilities for path planning,evacuation experiments were conducted using different maps featuring various obstacle types.Additionally,a multi-exit evacuation scenario was constructed according to the actual building environment of a teaching building.Both the sparrow search algorithm and MSSA algorithm were employed in the simulation experiment for multiexit evacuation path planning.The findings demonstrate that the MSSA algorithm outperforms the comparison algorithm,showcasing its greater advantages and higher application potential.
基金supported by the Chongqing Social Science Planning Fund,China(2023BS034)the Science and Technology Project of Chongqing Jiaotong University,China(F1230069).
文摘Green transformation is an unavoidable choice for resource-based cities(RBCs)that face resource depletion and environmental pollution.Existing research has focused primarily on specific RBCs,making it challenging to apply green transformation strategies universally across cities.The fuzzy set qualitative comparative analysis(fsQCA)is a combination of qualitative and quantitative analyses that can handle multiple concurrent causality problems and determine how different conditions combine into configurations and generate an outcome.Thus,to address this gap,in this study,we established a research framework for green transformation and utilized the fsQCA to examine the configurations of 113 RBCs in China.By incorporating the element of time,this study explored the dynamic evolution of solutions in 2013,2016,and 2019.The main findings indicate that individual elements do not constitute the necessary conditions for improving the green transformation efficiency(GTE),and the systematic combination of multiple conditions is an effective path for realizing the improvement of the GTE in RBCs.Green transformation paths of RBCs exhibit the same destination through different paths.Additionally,the combination of system environment elements and system structure elements is both complementary and alternative.Differences in RBCs have led to various factor combinations and development paths,but there are some similarities in the key elements of the factor combinations at different stages.Economic environment,government support,and technological innovation are key factors that universally enhance the GTE in RBCs.These insights can assist city managers in formulating policies to drive green transformation and contribute to a better theoretical understanding of green transformation paths in RBCs.
基金supported by the National Natural Science Foundation of China(71271018)
文摘Overlapping community detection in a network is a challenging issue which attracts lots of attention in recent years.A notion of hesitant node(HN) is proposed. An HN contacts with multiple communities while the communications are not strong or even accidental, thus the HN holds an implicit community structure.However, HNs are not rare in the real world network. It is important to identify them because they can be efficient hubs which form the overlapping portions of communities or simple attached nodes to some communities. Current approaches have difficulties in identifying and clustering HNs. A density-based rough set model(DBRSM) is proposed by combining the virtue of densitybased algorithms and rough set models. It incorporates the macro perspective of the community structure of the whole network and the micro perspective of the local information held by HNs, which would facilitate the further "growth" of HNs in community. We offer a theoretical support for this model from the point of strength of the trust path. The experiments on the real-world and synthetic datasets show the practical significance of analyzing and clustering the HNs based on DBRSM. Besides, the clustering based on DBRSM promotes the modularity optimization.
基金Supported by National Natural Science Foundation of China(Grant Nos.51305367,51575461)Doctoral Student Innovation Funds for Hai-Zhu Zhang from Southwest Jiaotong University,China
文摘Changes in requirements may result in the increasing of product development project cost and lead time, therefore, it is important to understand how require- ment changes propagate in the design of complex product systems and be able to select best options to guide design. Currently, a most approach for design change is lack of take the multi-disciplinary coupling relationships and the number of parameters into account integrally. A new design change model is presented to systematically analyze and search change propagation paths. Firstly, a PDS-Be- havior-Structure-based design change model is established to describe requirement changes causing the design change propagation in behavior and structure domains. Secondly, a multi-disciplinary oriented behavior matrix is utilized to support change propagation analysis of complex product systems, and the interaction relationships of the matrix elements are used to obtain an initial set of change paths. Finally, a rough set-based propagation space reducing tool is developed to assist in narrowing change propagation paths by computing the importance of the design change parameters. The proposed new design change model and its associated tools have been demonstrated by the scheduling change propagation paths of high speed train's bogie to show its feasibility and effectiveness. This model is not only supportive to response quickly to diversified market requirements, but also helpful to satisfy customer require- ments and reduce product development lead time. The proposed new design change model can be applied in a wide range of engineering systems design with improved efficiency.
文摘By means of Logic symmetric relation,the single neighboring Logic path for Ndimensions Boolean ordered set is solved.A new method of determining any logic neighboringsubset in limited dimension is proposed.Its results are intuitional and realizable for computer.
基金supported by the financial support of the ship segmentation intelligent manufacturing equipment solution and key common technology research,High-tech Ship Research Project of the Chinese Ministry of Science and Technology and the project of Shandong Provincial Key R&D Program(No.2019GGX104035).
文摘Path planning is a key technique of autonomous navigation for robots,and the velocity field is an important part.Constructing velocity field in a complex workspace is still challenging.In this paper,an inner normal guided segmentation algorithm in a complex polygon is proposed to decompose the complex workspace in this paper.The artificial potential field model based on probability theory is then used to calculate the potential field of the decomposed workspace,and the velocity field is obtained by utilizing the potential field of this workspace.Path optimization is implemented by curve evolution,during which the internal force generated in the smoothing process of the initial path by a mean filter and the external force is obtained from the gradient of the workspace potential field.The parameter selection principle is deduced by analyzing the influence of several parameters on the path length and smoothness.Simulation results show that the designed polygon decomposition algorithm can effectively segment complex workspace and that the path optimization algorithm can shorten and smoothen paths.