首页 > 最新文献

自主智能系统(英文)最新文献

英文 中文
Behavioral models of drivers in developing countries with an agent-based perspective: a literature review 基于代理视角的发展中国家驾驶员行为模型:文献综述
Pub Date : 2024-04-25 DOI: 10.1007/s43684-024-00061-1
Vishal A. Gracian, Stéphane Galland, Alexandre Lombard, Thomas Martinet, Nicolas Gaud, Hui Zhao, Ansar-Ul-Haque Yasar

The traffic in developing countries presents its own specificity, notably due to the heterogeneous traffic and a weak-lane discipline. This leads to differences in driver behavior between these countries and developed countries. Knowing that the analysis of the drivers from developed countries leads the design of the majority of driver models, it is not surprising that the simulations performed using these models do not match the field data of the developing countries. This article presents a systematic review of the literature on modeling driving behaviors in the context of developing countries. The study focuses on the microsimulation approaches, and specifically on the multiagent paradigm, that are considered suitable for reproducing driving behaviors with accuracy. The major contributions from the recent literature are analyzed. Three major scientific challenges and related minor research directions are described.

发展中国家的交通有其自身的特殊性,这主要是由于交通的多样性和车道规则的薄弱。这导致这些国家与发达国家的驾驶员行为存在差异。由于对发达国家驾驶员的分析导致了大多数驾驶员模型的设计,因此使用这些模型进行的模拟与发展中国家的实地数据不符也就不足为奇了。本文对有关发展中国家驾驶行为建模的文献进行了系统回顾。研究重点是微观模拟方法,特别是多代理范式,这些方法被认为适合于准确再现驾驶行为。对近期文献的主要贡献进行了分析。介绍了三大科学挑战和相关的次要研究方向。
{"title":"Behavioral models of drivers in developing countries with an agent-based perspective: a literature review","authors":"Vishal A. Gracian,&nbsp;Stéphane Galland,&nbsp;Alexandre Lombard,&nbsp;Thomas Martinet,&nbsp;Nicolas Gaud,&nbsp;Hui Zhao,&nbsp;Ansar-Ul-Haque Yasar","doi":"10.1007/s43684-024-00061-1","DOIUrl":"10.1007/s43684-024-00061-1","url":null,"abstract":"<div><p>The traffic in developing countries presents its own specificity, notably due to the heterogeneous traffic and a weak-lane discipline. This leads to differences in driver behavior between these countries and developed countries. Knowing that the analysis of the drivers from developed countries leads the design of the majority of driver models, it is not surprising that the simulations performed using these models do not match the field data of the developing countries. This article presents a systematic review of the literature on modeling driving behaviors in the context of developing countries. The study focuses on the microsimulation approaches, and specifically on the multiagent paradigm, that are considered suitable for reproducing driving behaviors with accuracy. The major contributions from the recent literature are analyzed. Three major scientific challenges and related minor research directions are described.</p></div>","PeriodicalId":71187,"journal":{"name":"自主智能系统(英文)","volume":"4 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s43684-024-00061-1.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140654630","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Distributed optimization via dynamic event-triggered scheme with metric subregularity condition 通过具有度量次规则条件的动态事件触发方案进行分布式优化
Pub Date : 2024-04-23 DOI: 10.1007/s43684-024-00063-z
Xin Yu, Xi Chen, Yuan Fan, Songsong Cheng

In this paper, we present a continuous-time algorithm with a dynamic event-triggered communication (DETC) mechanism for solving a class of distributed convex optimization problems that satisfy a metric subregularity condition. The proposed algorithm addresses the challenge of limited bandwidth in multi-agent systems by utilizing a continuous-time optimization approach with DETC. Furthermore, we prove that the distributed event-triggered algorithm converges exponentially to the optimal set, even without strong convexity conditions. Finally, we provide a comparison example to demonstrate the efficiency of our algorithm in communication resource-saving.

在本文中,我们提出了一种具有动态事件触发通信(DETC)机制的连续时间算法,用于解决一类满足度量次规则条件的分布式凸优化问题。所提出的算法利用带 DETC 的连续时间优化方法,解决了多代理系统中带宽有限的难题。此外,我们还证明,即使没有强凸性条件,分布式事件触发算法也能指数级收敛到最优集。最后,我们提供了一个比较实例,以证明我们的算法在节省通信资源方面的效率。
{"title":"Distributed optimization via dynamic event-triggered scheme with metric subregularity condition","authors":"Xin Yu,&nbsp;Xi Chen,&nbsp;Yuan Fan,&nbsp;Songsong Cheng","doi":"10.1007/s43684-024-00063-z","DOIUrl":"10.1007/s43684-024-00063-z","url":null,"abstract":"<div><p>In this paper, we present a continuous-time algorithm with a dynamic event-triggered communication (DETC) mechanism for solving a class of distributed convex optimization problems that satisfy a metric subregularity condition. The proposed algorithm addresses the challenge of limited bandwidth in multi-agent systems by utilizing a continuous-time optimization approach with DETC. Furthermore, we prove that the distributed event-triggered algorithm converges exponentially to the optimal set, even without strong convexity conditions. Finally, we provide a comparison example to demonstrate the efficiency of our algorithm in communication resource-saving.</p></div>","PeriodicalId":71187,"journal":{"name":"自主智能系统(英文)","volume":"4 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s43684-024-00063-z.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140671897","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Prediction for nonlinear time series by improved deep echo state network based on reservoir states reconstruction 基于储层状态重构的改进型深度回波态网络的非线性时间序列预测
Pub Date : 2024-02-21 DOI: 10.1007/s43684-023-00057-3
Qiufeng Yu, Hui Zhao, Li Teng, Li Li, Ansar Yasar, Stéphane Galland

With the aim to enhance prediction accuracy for nonlinear time series, this paper put forward an improved deep Echo State Network based on reservoir states reconstruction driven by a Self-Normalizing Activation (SNA) function as the replacement for the traditional Hyperbolic tangent activation function to reduce the model’s sensitivity to hyper-parameters. The Strategy was implemented in a two-state reconstruction process by first inputting the time series data to the model separately. Once, the time data passes through the reservoirs and is activated by the SNA activation function, the new state for the reservoirs is created. The state is input to the next layer, and the concatenate states module saves. Pairs of states are selected from the activated multi-layer reservoirs and input into the state reconstruction module. Multiple input states are transformed through the state reconstruction module and finally saved to the concatenate state module. Two evaluation metrics were used to benchmark against three other ESNs with SNA activation functions to achieve better prediction accuracy.

为了提高非线性时间序列的预测精度,本文提出了一种基于水库状态重构的改进型深度回波状态网络,用自归一化激活(SNA)函数替代传统的双曲正切激活函数,以降低模型对超参数的敏感性。该策略在双态重构过程中实施,首先将时间序列数据分别输入模型。一旦时间数据通过储层并被 SNA 激活函数激活,储层的新状态就会产生。该状态被输入到下一层,并由连接状态模块保存。从激活的多层蓄水池中选取成对的状态,输入状态重建模块。多个输入状态通过状态重构模块进行转换,最后保存到串联状态模块。为了达到更高的预测精度,我们使用了两个评估指标来与其他三个使用 SNA 激活函数的 ESN 进行比较。
{"title":"Prediction for nonlinear time series by improved deep echo state network based on reservoir states reconstruction","authors":"Qiufeng Yu,&nbsp;Hui Zhao,&nbsp;Li Teng,&nbsp;Li Li,&nbsp;Ansar Yasar,&nbsp;Stéphane Galland","doi":"10.1007/s43684-023-00057-3","DOIUrl":"10.1007/s43684-023-00057-3","url":null,"abstract":"<div><p>With the aim to enhance prediction accuracy for nonlinear time series, this paper put forward an improved deep Echo State Network based on reservoir states reconstruction driven by a Self-Normalizing Activation (SNA) function as the replacement for the traditional Hyperbolic tangent activation function to reduce the model’s sensitivity to hyper-parameters. The Strategy was implemented in a two-state reconstruction process by first inputting the time series data to the model separately. Once, the time data passes through the reservoirs and is activated by the SNA activation function, the new state for the reservoirs is created. The state is input to the next layer, and the concatenate states module saves. Pairs of states are selected from the activated multi-layer reservoirs and input into the state reconstruction module. Multiple input states are transformed through the state reconstruction module and finally saved to the concatenate state module. Two evaluation metrics were used to benchmark against three other ESNs with SNA activation functions to achieve better prediction accuracy.</p></div>","PeriodicalId":71187,"journal":{"name":"自主智能系统(英文)","volume":"4 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s43684-023-00057-3.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140443110","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Shapley value: from cooperative game to explainable artificial intelligence 沙普利值:从合作博弈到可解释的人工智能
Pub Date : 2024-02-09 DOI: 10.1007/s43684-023-00060-8
Meng Li, Hengyang Sun, Yanjun Huang, Hong Chen

With the tremendous success of machine learning (ML), concerns about their black-box nature have grown. The issue of interpretability affects trust in ML systems and raises ethical concerns such as algorithmic bias. In recent years, the feature attribution explanation method based on Shapley value has become the mainstream explainable artificial intelligence approach for explaining ML models. This paper provides a comprehensive overview of Shapley value-based attribution methods. We begin by outlining the foundational theory of Shapley value rooted in cooperative game theory and discussing its desirable properties. To enhance comprehension and aid in identifying relevant algorithms, we propose a comprehensive classification framework for existing Shapley value-based feature attribution methods from three dimensions: Shapley value type, feature replacement method, and approximation method. Furthermore, we emphasize the practical application of the Shapley value at different stages of ML model development, encompassing pre-modeling, modeling, and post-modeling phases. Finally, this work summarizes the limitations associated with the Shapley value and discusses potential directions for future research.

随着机器学习(ML)的巨大成功,人们对其黑箱性质的担忧与日俱增。可解释性问题影响了人们对 ML 系统的信任,并引发了算法偏见等伦理问题。近年来,基于 Shapley 值的特征归因解释方法已成为解释 ML 模型的主流可解释人工智能方法。本文全面概述了基于 Shapley 值的归因方法。我们首先概述了植根于合作博弈论的 Shapley 值基础理论,并讨论了其理想特性。为了加深理解并帮助识别相关算法,我们从三个维度为现有的基于 Shapley 值的特征归因方法提出了一个综合分类框架:夏普利值类型、特征替换方法和近似方法。此外,我们还强调了 Shapley 值在 ML 模型开发不同阶段的实际应用,包括建模前、建模和建模后阶段。最后,这项工作总结了与 Shapley 值相关的局限性,并讨论了未来研究的潜在方向。
{"title":"Shapley value: from cooperative game to explainable artificial intelligence","authors":"Meng Li,&nbsp;Hengyang Sun,&nbsp;Yanjun Huang,&nbsp;Hong Chen","doi":"10.1007/s43684-023-00060-8","DOIUrl":"10.1007/s43684-023-00060-8","url":null,"abstract":"<div><p>With the tremendous success of machine learning (ML), concerns about their black-box nature have grown. The issue of interpretability affects trust in ML systems and raises ethical concerns such as algorithmic bias. In recent years, the feature attribution explanation method based on Shapley value has become the mainstream explainable artificial intelligence approach for explaining ML models. This paper provides a comprehensive overview of Shapley value-based attribution methods. We begin by outlining the foundational theory of Shapley value rooted in cooperative game theory and discussing its desirable properties. To enhance comprehension and aid in identifying relevant algorithms, we propose a comprehensive classification framework for existing Shapley value-based feature attribution methods from three dimensions: Shapley value type, feature replacement method, and approximation method. Furthermore, we emphasize the practical application of the Shapley value at different stages of ML model development, encompassing pre-modeling, modeling, and post-modeling phases. Finally, this work summarizes the limitations associated with the Shapley value and discusses potential directions for future research.</p></div>","PeriodicalId":71187,"journal":{"name":"自主智能系统(英文)","volume":"4 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-02-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s43684-023-00060-8.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139850285","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Driving into the future: a cross-cutting analysis of distributed artificial intelligence, CCAM and the platform economy 驶向未来:对分布式人工智能、CCAM 和平台经济的横向分析
Pub Date : 2024-01-03 DOI: 10.1007/s43684-023-00059-1
Marc Guerreiro Augusto, Benjamin Acar, Andrea Carolina Soto, Fikret Sivrikaya, Sahin Albayrak

The future of driving is autonomous. It requires a comprehensive stack of embedded software components, enabled by open-source and proprietary platforms at different abstraction layers, and then operating within a larger ecosystem. Autonomous driving demands connectivity, cooperation and automation to form the cornerstone of autonomous mobility solutions. Platform economy principles have revolutionized the way we produce, deliver and consume products and services worldwide. More and more businesses in the field of mobility and transport appear to implement transaction, innovation, and integration platforms as core enablers for Mobility-as-a-Service and transport applications. Artificial intelligence approaches, especially those dealing with distributed systems, enable new mobility solutions, such as autonomous driving. This paper contributes to understanding the intertwining role between distributed artificial intelligence, autonomous mobility and the resulting platform ecosystem. A systematic literature review is applied, in order to identify the intersection between those aspects. Furthermore, the research project BeIntelli is considered as a hands-on application of our findings. Taking into account our analysis and the aforementioned research project, we pose a blueprint architecture for autonomous mobility. This architecture is the subject of further research. Our conclusions facilitate the development and implementation of future urban transportation systems and resulting mobility ecosystems in practice.

未来的驾驶是自动驾驶。它需要一个全面的嵌入式软件组件堆栈,由不同抽象层的开源和专有平台实现,然后在一个更大的生态系统中运行。自动驾驶需要连通性、合作性和自动化,它们构成了自动交通解决方案的基石。平台经济原则彻底改变了全球生产、交付和消费产品与服务的方式。移动和交通领域越来越多的企业开始实施交易、创新和集成平台,将其作为移动即服务和交通应用的核心推动力。人工智能方法,尤其是处理分布式系统的方法,使自动驾驶等新的移动解决方案成为可能。本文有助于理解分布式人工智能、自动驾驶以及由此产生的平台生态系统之间的相互交织作用。本文采用了系统的文献综述,以确定这些方面之间的交叉点。此外,研究项目 BeIntelli 被视为我们研究成果的实践应用。考虑到我们的分析和上述研究项目,我们提出了自主移动性的蓝图架构。该架构是进一步研究的主题。我们的结论有助于在实践中开发和实施未来的城市交通系统以及由此产生的移动生态系统。
{"title":"Driving into the future: a cross-cutting analysis of distributed artificial intelligence, CCAM and the platform economy","authors":"Marc Guerreiro Augusto,&nbsp;Benjamin Acar,&nbsp;Andrea Carolina Soto,&nbsp;Fikret Sivrikaya,&nbsp;Sahin Albayrak","doi":"10.1007/s43684-023-00059-1","DOIUrl":"10.1007/s43684-023-00059-1","url":null,"abstract":"<div><p>The future of driving is autonomous. It requires a comprehensive stack of embedded software components, enabled by open-source and proprietary platforms at different abstraction layers, and then operating within a larger ecosystem. Autonomous driving demands connectivity, cooperation and automation to form the cornerstone of autonomous mobility solutions. Platform economy principles have revolutionized the way we produce, deliver and consume products and services worldwide. More and more businesses in the field of mobility and transport appear to implement transaction, innovation, and integration platforms as core enablers for Mobility-as-a-Service and transport applications. Artificial intelligence approaches, especially those dealing with distributed systems, enable new mobility solutions, such as autonomous driving. This paper contributes to understanding the intertwining role between distributed artificial intelligence, autonomous mobility and the resulting platform ecosystem. A systematic literature review is applied, in order to identify the intersection between those aspects. Furthermore, the research project BeIntelli is considered as a hands-on application of our findings. Taking into account our analysis and the aforementioned research project, we pose a blueprint architecture for autonomous mobility. This architecture is the subject of further research. Our conclusions facilitate the development and implementation of future urban transportation systems and resulting mobility ecosystems in practice.</p></div>","PeriodicalId":71187,"journal":{"name":"自主智能系统(英文)","volume":"4 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s43684-023-00059-1.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139387631","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Distilling base-and-meta network with contrastive learning for few-shot semantic segmentation 利用对比学习提炼基元和元网络,实现少量语义分割
Pub Date : 2023-11-27 DOI: 10.1007/s43684-023-00058-2
Xinyue Chen, Yueyi Wang, Yingyue Xu, Miaojing Shi

Current studies in few-shot semantic segmentation mostly utilize meta-learning frameworks to obtain models that can be generalized to new categories. However, these models trained on base classes with sufficient annotated samples are biased towards these base classes, which results in semantic confusion and ambiguity between base classes and new classes. A strategy is to use an additional base learner to recognize the objects of base classes and then refine the prediction results output by the meta learner. In this way, the interaction between these two learners and the way of combining results from the two learners are important. This paper proposes a new model, namely Distilling Base and Meta (DBAM) network by using self-attention mechanism and contrastive learning to enhance the few-shot segmentation performance. First, the self-attention-based ensemble module (SEM) is proposed to produce a more accurate adjustment factor for improving the fusion of two predictions of the two learners. Second, the prototype feature optimization module (PFOM) is proposed to provide an interaction between the two learners, which enhances the ability to distinguish the base classes from the target class by introducing contrastive learning loss. Extensive experiments have demonstrated that our method improves on the PASCAL-5i under 1-shot and 5-shot settings, respectively.

目前有关少量语义分割的研究大多利用元学习框架来获得可推广到新类别的模型。然而,这些在有足够注释样本的基类上训练出来的模型偏向于这些基类,从而导致基类和新类别之间的语义混淆和模糊。一种策略是使用额外的基类学习器来识别基类对象,然后完善元学习器输出的预测结果。这样一来,这两个学习器之间的互动以及将两个学习器的结果结合起来的方式就变得非常重要。本文提出了一种新的模型,即利用自我注意机制和对比学习来提高少镜头分割性能的 Distilling Base and Meta(DBAM)网络。首先,提出了基于自我注意的集合模块(SEM),以产生更精确的调整因子,改善两个学习器的两个预测的融合。其次,提出了原型特征优化模块(PFOM),以提供两个学习器之间的互动,通过引入对比学习损失来增强区分基础类和目标类的能力。广泛的实验证明,我们的方法在 1 次和 5 次的设置下分别比 PASCAL-5i 有所改进。
{"title":"Distilling base-and-meta network with contrastive learning for few-shot semantic segmentation","authors":"Xinyue Chen,&nbsp;Yueyi Wang,&nbsp;Yingyue Xu,&nbsp;Miaojing Shi","doi":"10.1007/s43684-023-00058-2","DOIUrl":"10.1007/s43684-023-00058-2","url":null,"abstract":"<div><p>Current studies in few-shot semantic segmentation mostly utilize meta-learning frameworks to obtain models that can be generalized to new categories. However, these models trained on base classes with sufficient annotated samples are biased towards these base classes, which results in semantic confusion and ambiguity between base classes and new classes. A strategy is to use an additional base learner to recognize the objects of base classes and then refine the prediction results output by the meta learner. In this way, the interaction between these two learners and the way of combining results from the two learners are important. This paper proposes a new model, namely Distilling Base and Meta (DBAM) network by using self-attention mechanism and contrastive learning to enhance the few-shot segmentation performance. First, the self-attention-based ensemble module (SEM) is proposed to produce a more accurate adjustment factor for improving the fusion of two predictions of the two learners. Second, the prototype feature optimization module (PFOM) is proposed to provide an interaction between the two learners, which enhances the ability to distinguish the base classes from the target class by introducing contrastive learning loss. Extensive experiments have demonstrated that our method improves on the PASCAL-5<sup><i>i</i></sup> under 1-shot and 5-shot settings, respectively.</p></div>","PeriodicalId":71187,"journal":{"name":"自主智能系统(英文)","volume":"3 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-11-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s43684-023-00058-2.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139234399","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Remote collaborative process optimization in research and design of industrial manufacturing 工业制造研究与设计中的远程协作流程优化
Pub Date : 2023-11-20 DOI: 10.1007/s43684-023-00056-4
Siqin Wang, Qingdu Li

In response to the impact of COVID-19, the manufacturing industry and academic industrial research have largely shifted to online or hybrid conference formats. The sudden change has posed challenges for researchers and teams to adapt. Based on the current state of online conferences, inadequate communication, disruptions during meetings, confusion and loss of meeting information, and difficulties in conducting online collaborations are observed. This paper presents a design of a real-time discussion board that combines online conferences and synchronous discussions to address the issues arising from remote collaborations in industrial research. The research demonstrates that synchronous discussions conducted within multi-team industrial collaboration teams with specific and diverse issues can better control the flow of meetings, enhance meeting efficiency, promote participant interaction and engagement, reduce information loss, and weaken the boundaries between online and offline collaboration.

为应对 COVID-19 的影响,制造业和学术工业研究已在很大程度上转向在线或混合会议形式。这一突如其来的变化给研究人员和团队的适应带来了挑战。基于在线会议的现状,人们观察到沟通不足、会议中断、会议信息混乱和丢失,以及开展在线合作的困难。本文介绍了一种结合在线会议和同步讨论的实时讨论板的设计,以解决工业研究中远程协作所产生的问题。研究表明,在多团队工业协作团队中针对特定和多样化问题进行同步讨论,可以更好地控制会议流程,提高会议效率,促进与会者的互动和参与,减少信息丢失,弱化在线和离线协作之间的界限。
{"title":"Remote collaborative process optimization in research and design of industrial manufacturing","authors":"Siqin Wang,&nbsp;Qingdu Li","doi":"10.1007/s43684-023-00056-4","DOIUrl":"10.1007/s43684-023-00056-4","url":null,"abstract":"<div><p>In response to the impact of COVID-19, the manufacturing industry and academic industrial research have largely shifted to online or hybrid conference formats. The sudden change has posed challenges for researchers and teams to adapt. Based on the current state of online conferences, inadequate communication, disruptions during meetings, confusion and loss of meeting information, and difficulties in conducting online collaborations are observed. This paper presents a design of a real-time discussion board that combines online conferences and synchronous discussions to address the issues arising from remote collaborations in industrial research. The research demonstrates that synchronous discussions conducted within multi-team industrial collaboration teams with specific and diverse issues can better control the flow of meetings, enhance meeting efficiency, promote participant interaction and engagement, reduce information loss, and weaken the boundaries between online and offline collaboration.</p></div>","PeriodicalId":71187,"journal":{"name":"自主智能系统(英文)","volume":"3 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s43684-023-00056-4.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139254991","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Reviews and prospects in satellite range scheduling problem 卫星航程调度问题的回顾与展望
Pub Date : 2023-10-18 DOI: 10.1007/s43684-023-00054-6
Shuwei Li, Qingyun Yu, Hao Ding

With the increasing number of space satellites, the demand for satellite communication (including maneuvering, command uploading and data downloading) has also grown significantly. However, the actual communication resources of ground station are relatively limited, which leads to an oversubscribed problem. How to make use of limited ground station resources to complete satellite communication requests more fully and efficiently in the strict visible time is the focus of satellite range scheduling research. This paper reviews and looks forward to the research on Satellite Range Scheduling Problem (SRSP). Firstly, SRSP is defined as the scheduling problem of establishing communication between satellites and ground stations, and the classification and development of SRSP are introduced. Then, this paper analyzes three common problem description models, and establishes a mathematical model based on the analysis of optimization objectives and constraints. Thirdly, this paper classifies and summarizes the common solving methods of SRSP, and analyzes their characteristics and application scenarios. Finally, combined with the work in this paper, the future research direction of SRSP is envisioned.

随着空间卫星数量的不断增加,对卫星通信(包括操纵、指令上传和数据下载)的需求也大幅增长。然而,地面站的实际通信资源却相对有限,这就导致了超额完成任务的问题。如何利用有限的地面站资源,在严格的可见时间内更充分、更高效地完成卫星通信请求,是卫星测距调度研究的重点。本文对卫星范围调度问题(SRSP)的研究进行了回顾和展望。首先,将 SRSP 定义为卫星与地面站之间建立通信的调度问题,并介绍了 SRSP 的分类和发展。然后,本文分析了三种常见的问题描述模型,并在分析优化目标和约束条件的基础上建立了数学模型。第三,本文对 SRSP 的常见求解方法进行了分类和总结,并分析了其特点和应用场景。最后,结合本文的工作,展望了 SRSP 未来的研究方向。
{"title":"Reviews and prospects in satellite range scheduling problem","authors":"Shuwei Li,&nbsp;Qingyun Yu,&nbsp;Hao Ding","doi":"10.1007/s43684-023-00054-6","DOIUrl":"10.1007/s43684-023-00054-6","url":null,"abstract":"<div><p>With the increasing number of space satellites, the demand for satellite communication (including maneuvering, command uploading and data downloading) has also grown significantly. However, the actual communication resources of ground station are relatively limited, which leads to an oversubscribed problem. How to make use of limited ground station resources to complete satellite communication requests more fully and efficiently in the strict visible time is the focus of satellite range scheduling research. This paper reviews and looks forward to the research on Satellite Range Scheduling Problem (SRSP). Firstly, SRSP is defined as the scheduling problem of establishing communication between satellites and ground stations, and the classification and development of SRSP are introduced. Then, this paper analyzes three common problem description models, and establishes a mathematical model based on the analysis of optimization objectives and constraints. Thirdly, this paper classifies and summarizes the common solving methods of SRSP, and analyzes their characteristics and application scenarios. Finally, combined with the work in this paper, the future research direction of SRSP is envisioned.</p></div>","PeriodicalId":71187,"journal":{"name":"自主智能系统(英文)","volume":"3 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s43684-023-00054-6.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135885180","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A dynamic core evolutionary clustering algorithm based on saturated memory 基于饱和内存的动态核心进化聚类算法
Pub Date : 2023-10-11 DOI: 10.1007/s43684-023-00055-5
Haibin Xie, Peng Li, Zhiyong Ding

Because the number of clustering cores needs to be set before implementing the K-means algorithm, this type of algorithm often fails in applications with increasing data and changing distribution characteristics. This paper proposes an evolutionary algorithm DCC, which can dynamically adjust the number of clustering cores with data change. DCC algorithm uses the Gaussian function as the activation function of each core. Each clustering core can adjust its center vector and coverage based on the response to the input data and its memory state to better fit the sample clusters in the space. The DCC algorithm model can evolve from 0. After each new sample is added, the winning dynamic core can be adjusted or split by competitive learning, so that the number of clustering cores of the algorithm always maintains a better adaptation relationship with the existing data. Furthermore, because its clustering core can split, it can subdivide the densely distributed data clusters. Finally, detailed experimental results show that the evolutionary clustering algorithm DCC based on the dynamic core method has excellent clustering performance and strong robustness.

由于在实施 K-means 算法之前需要设定聚类核心的数量,因此在数据不断增加、分布特征不断变化的应用中,这种算法往往会失效。本文提出了一种进化算法 DCC,它可以随着数据的变化动态调整聚类核的数量。DCC 算法使用高斯函数作为每个聚类核的激活函数。每个聚类核都可以根据对输入数据的响应及其内存状态调整其中心向量和覆盖范围,以更好地拟合空间中的样本聚类。DCC 算法模型可以从 0 开始演化,每增加一个新样本后,可以通过竞争学习调整或拆分获胜的动态核心,从而使算法的聚类核心数量始终与现有数据保持较好的适应关系。此外,由于其聚类核心可以拆分,因此可以对密集分布的数据集群进行细分。最后,详细的实验结果表明,基于动态核心法的进化聚类算法 DCC 具有优异的聚类性能和较强的鲁棒性。
{"title":"A dynamic core evolutionary clustering algorithm based on saturated memory","authors":"Haibin Xie,&nbsp;Peng Li,&nbsp;Zhiyong Ding","doi":"10.1007/s43684-023-00055-5","DOIUrl":"10.1007/s43684-023-00055-5","url":null,"abstract":"<div><p>Because the number of clustering cores needs to be set before implementing the K-means algorithm, this type of algorithm often fails in applications with increasing data and changing distribution characteristics. This paper proposes an evolutionary algorithm DCC, which can dynamically adjust the number of clustering cores with data change. DCC algorithm uses the Gaussian function as the activation function of each core. Each clustering core can adjust its center vector and coverage based on the response to the input data and its memory state to better fit the sample clusters in the space. The DCC algorithm model can evolve from 0. After each new sample is added, the winning dynamic core can be adjusted or split by competitive learning, so that the number of clustering cores of the algorithm always maintains a better adaptation relationship with the existing data. Furthermore, because its clustering core can split, it can subdivide the densely distributed data clusters. Finally, detailed experimental results show that the evolutionary clustering algorithm DCC based on the dynamic core method has excellent clustering performance and strong robustness.</p></div>","PeriodicalId":71187,"journal":{"name":"自主智能系统(英文)","volume":"3 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s43684-023-00055-5.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136209955","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A tripartite evolutionary game analysis of providing subsidies for pick-up/drop-off strategy in carpooling problem 拼车问题中为接送策略提供补贴的三方进化博弈分析
Pub Date : 2023-09-25 DOI: 10.1007/s43684-023-00053-7
Zeyuan Yan, Li Li, Hui Zhao, Yazan Mualla, Ansar Yasar

Although the pick-up/drop-off (PUDO) strategy in carpooling offers the convenience of short-distance walking for passengers during boarding and disembarking, there is a noticeable hesitancy among commuters to adopt this travel method, despite its numerous benefits. Here, this paper establishes a tripartite evolutionary game theory (EGT) model to verify the evolutionary stability of choosing the PUDO strategy of drivers and passengers and offering subsidies strategy of carpooling platforms in carpooling system. The model presented in this paper serves as a valuable tool for assessing the dissemination and implementation of PUDO strategy and offering subsidies strategy in carpooling applications. Subsequently, an empirical analysis is conducted to examine and compare the sensitivity of the parameters across various scenarios. The findings suggest that: firstly, providing subsidies to passengers and drivers, along with deductions for drivers through carpooling platforms, is an effective way to promote wider adoption of the PUDO strategy. Then, the decision-making process is divided into three stages: initial stage, middle stage, and mature stage. PUDO strategy progresses from initial rejection to widespread acceptance among drivers in the middle stage and, in the mature stage, both passengers and drivers tend to adopt it under carpooling platform subsidies; the factors influencing the costs of waiting and walking times, as well as the subsidies granted to passengers, are essential determinants that require careful consideration by passengers, drivers, and carpooling platforms when choosing the PUDO strategy. Our work provides valuable insight into the PUDO strategy’s applicability and the declared results provide implications for traffic managers and carpooling platforms to offer a suitable incentive.

虽然拼车中的接送策略(PUDO)为乘客在上下车时提供了短距离步行的便利,但尽管这种出行方式好处多多,通勤者对采用这种出行方式却明显犹豫不决。在此,本文建立了一个三方演化博弈论(EGT)模型,以验证拼车系统中司机和乘客的 PUDO 策略选择以及拼车平台提供补贴策略的演化稳定性。本文提出的模型是评估拼车应用中 PUDO 策略和提供补贴策略的传播和实施情况的重要工具。随后,本文进行了实证分析,研究和比较了各种情况下参数的敏感性。研究结果表明:首先,通过拼车平台为乘客和司机提供补贴,同时为司机提供扣款,是促进更广泛采用 PUDO 战略的有效方法。然后,决策过程分为三个阶段:初始阶段、中期阶段和成熟阶段。在成熟阶段,乘客和司机都倾向于在拼车平台的补贴下采用 PUDO 战略;在选择 PUDO 战略时,影响等待和步行时间成本的因素以及给予乘客的补贴是乘客、司机和拼车平台需要慎重考虑的重要决定因素。我们的工作为 PUDO 策略的适用性提供了宝贵的见解,申报结果为交通管理人员和拼车平台提供适当的激励措施提供了启示。
{"title":"A tripartite evolutionary game analysis of providing subsidies for pick-up/drop-off strategy in carpooling problem","authors":"Zeyuan Yan,&nbsp;Li Li,&nbsp;Hui Zhao,&nbsp;Yazan Mualla,&nbsp;Ansar Yasar","doi":"10.1007/s43684-023-00053-7","DOIUrl":"10.1007/s43684-023-00053-7","url":null,"abstract":"<div><p>Although the pick-up/drop-off (PUDO) strategy in carpooling offers the convenience of short-distance walking for passengers during boarding and disembarking, there is a noticeable hesitancy among commuters to adopt this travel method, despite its numerous benefits. Here, this paper establishes a tripartite evolutionary game theory (EGT) model to verify the evolutionary stability of choosing the PUDO strategy of drivers and passengers and offering subsidies strategy of carpooling platforms in carpooling system. The model presented in this paper serves as a valuable tool for assessing the dissemination and implementation of PUDO strategy and offering subsidies strategy in carpooling applications. Subsequently, an empirical analysis is conducted to examine and compare the sensitivity of the parameters across various scenarios. The findings suggest that: firstly, providing subsidies to passengers and drivers, along with deductions for drivers through carpooling platforms, is an effective way to promote wider adoption of the PUDO strategy. Then, the decision-making process is divided into three stages: initial stage, middle stage, and mature stage. PUDO strategy progresses from initial rejection to widespread acceptance among drivers in the middle stage and, in the mature stage, both passengers and drivers tend to adopt it under carpooling platform subsidies; the factors influencing the costs of waiting and walking times, as well as the subsidies granted to passengers, are essential determinants that require careful consideration by passengers, drivers, and carpooling platforms when choosing the PUDO strategy. Our work provides valuable insight into the PUDO strategy’s applicability and the declared results provide implications for traffic managers and carpooling platforms to offer a suitable incentive.</p></div>","PeriodicalId":71187,"journal":{"name":"自主智能系统(英文)","volume":"3 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s43684-023-00053-7.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135816849","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
自主智能系统(英文)
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1