Search results

Social network group decision-making (SNGDM) has rapidly developed because of the impact of social relationships on decision-making behavior. However, not only do social relationships affect decision-making behavior, but decision-making behavior also affects social relationships. Such complicated interactions are rarely considered in current research. To bridge this gap, this study proposes an SNGDM model that considers the interaction between social trust relationships and opinion evolution.

First, the trust propagation and aggregation operators are improved to obtain a complete social trust relationship among decision-makers (DMs). Second, the evolution of preference information under the influence of trust relationships is measured, and the development of trust relationships during consensus interactions is predicted. Finally, the iteration of consensus interactions is simulated using an opinion dynamics model. A case study is used to verify the feasibility of the proposed model.

The proposed model can predict consensus achievement based on a group’s initial trust relationship and preference information and effectively captures the dynamic characteristics of opinion evolution in social networks.

This study proposes an SNGDM model that considers the interaction of trust and opinion. The proposed model improves trust propagation and aggregation operators, determines improved preference information based on the existing trust relationships and predicts the evolution of trust relationships in the consensus process. The dynamic interaction between the two accelerates DMs to reach a consensus.

This paper aims to propose a method for automatic design of additive manufacturing (AM) flow channel paths driven by path length and pressure loss. The research focuses on the automatic design of channel paths, intending to achieve the shortest flow channel length or minimum pressure loss and improve the design efficiency of AM parts.

The initial layout of the flow channels is redesigned to consider the channels print supports. Boundary conditions and constraints are defined according to the redesigned channels layout, and the equation consisting of channel length and pressure loss is used as the objective function. Then the path planning simulation is performed based on particle swarm algorithm. The proposed method describes the path of flow channels using spline cures. The spline curve is controlled by particle (one particle represents a path), and the particle is randomly generated within the design space. After the path planning simulation is completed, the generated paths are used to create 3D parts.

Case study 1 demonstrates the automatic design of hydraulic spool valve. Compared to conventional spool valve, the pressure loss was reduced by 86% and the mass was reduced by 83%. The design results of case study 2 indicate that this approach is able to find the shortest channel path with lower computational cost.

The automatic design method of flow channel paths driven by path length and pressure loss presented in this paper provides a novel solution for the creation of AM flow components.

To make the robot that have real autonomous ability is always the goal of mobile robot research. For mobile robots, simultaneous localization and mapping (SLAM) research is no longer satisfied with enabling robots to build maps by remote control, more needs will focus on the autonomous exploration of unknown areas, which refer to the low light, complex spatial features and a series of unstructured environment, lick underground special space (dark and multiintersection). This study aims to propose a novel robot structure with mapping and autonomous exploration algorithms. The experiment proves the detection ability of the robot.

A small bio-inspired mobile robot suitable for underground special space (dark and multiintersection) is designed, and the control system is set up based on STM32 and Jetson Nano. The robot is equipped with double laser sensor and Ackerman chassis structure, which can adapt to the practical requirements of exploration in underground special space. Based on the graph optimization SLAM method, an optimization method for map construction is proposed. The Iterative Closest Point (ICP) algorithm is used to match two frames of laser to recalculate the relative pose of the robot, which improves the sensor utilization rate of the robot in underground space and also increase the synchronous positioning accuracy. Moreover, based on boundary cells and rapidly-exploring random tree (RRT) algorithm, a new Bio-RRT method for robot autonomous exploration is proposed in addition.

According to the experimental results, it can be seen that the upgraded SLAM method proposed in this paper achieves better results in map construction. At the same time, the algorithm presents good real-time performance as well as high accuracy and strong maintainability, particularly it can update the map continuously with the passing of time and ensure the positioning accuracy in the process of map updating. The Bio-RRT method fused with the firing excitation mechanism of boundary cells has a more purposeful random tree growth. The number of random tree expansion nodes is less, and the amount of information to be processed is reduced, which leads to the path planning time shorter and the efficiency higher. In addition, the target bias makes the random tree grow directly toward the target point with a certain probability, and the obtained path nodes are basically distributed on or on both sides of the line between the initial point and the target point, which makes the path length shorter and reduces the moving cost of the mobile robot. The final experimental results demonstrate that the proposed upgraded SLAM and Bio-RRT methods can better complete the underground special space exploration task.

Based on the background of robot autonomous exploration in underground special space, a new bio-inspired mobile robot structure with mapping and autonomous exploration algorithm is proposed in this paper. The robot structure is constructed, and the perceptual unit, control unit, driving unit and communication unit are described in detail. The robot can satisfy the practical requirements of exploring the underground dark and multiintersection space. Then, the upgraded graph optimization laser SLAM algorithm and interframe matching optimization method are proposed in this paper. The Bio-RRT independent exploration method is finally proposed, which takes shorter time in equally open space and the search strategy for multiintersection space is more efficient. The experimental results demonstrate that the proposed upgrade SLAM and Bio-RRT methods can better complete the underground space exploration task.

This study aims to explore the different effects of inter-community group networks and intra-community group networks on group innovation.

The authors used a pooled panel dataset of 12,111 self-organizing innovation groups in 463 game product creative workshop communities from Steam support to test the hypothesis. The pooled ordinary least squares (OLS) model is used for analyzing the data.

The results show that network constraint is negatively associated with the innovation performance of online groups. The average path length of the inter-community group network negatively moderates the relationship between network constraint and group innovation, while the average path length of the intra-community group network positively moderates the relationship between network constraint and group innovation. In addition, both the network density of inter-community group networks and intra-community group networks can negatively moderate the negative relationship between network constraint and group innovation.

The findings of this study suggest that network structural characteristics of inter-community networks and intra-community networks have different effects on online groups’ product innovation, and therefore, group members should consider their inter- and intra-community connections when choosing other groups to form a collaborative innovation relationship.

This study aims to propose an efficient dual-robot task collaboration strategy to address the issue of low work efficiency and inability to meet the production needs of a single robot during construction operations.

A hybrid task allocation method based on integer programming and auction algorithms, with the aim of achieving a balanced workload between two robots has been proposed. In addition, while ensuring reasonable workload allocation between the two robots, an improved dual ant colony algorithm was used to solve the dual traveling salesman problem, and the global path planning of the two robots was determined, resulting in an efficient and collision-free path for the dual robots to operate. Meanwhile, an improved fast Random tree rapidly-exploring random tree algorithm is introduced as a local obstacle avoidance strategy.

The proposed method combines randomization and iteration techniques to achieve an efficient task allocation strategy for two robots, ensuring the relative optimal global path of the two robots in cooperation and solving complex local obstacle avoidance problems.

This method is applied to the scene of steel bar tying in construction work, with the workload allocation and collaborative work between two robots as evaluation indicators. The experimental results show that this method can efficiently complete the steel bar banding operation, effectively reduce the interference between the two robots and minimize the interference of obstacles in the environment.

This study aims to use geographical information on social media for public opinion risk identification during a crisis.

This study constructs a double-layer network that associates the online public opinion with geographical information. In the double-layer network, Gaussian process regression is used to train the prediction model for geographical locations. Second, cross-space information flow is described using local government data availability and regional internet development indicators. Finally, the structural characteristics and information flow of the double-layer network are explored to capture public opinion risks in a fine-grained manner. This study used the early stages of the COVID-19 outbreak for validation analyses, and it collected more than 90,000 pieces of public opinion data from microblogs.

In the early stages of the COVID-19 outbreak, the double-layer network exhibited a radiating state, and the information dissemination was more dependent on the nodes with higher in-degree. Moreover, the double-layer network structure showed geographical differences. The risk contagion was more significant in areas where information flow was prominent, but the influence of nodes was reduced.

Public opinion risk identification that incorporates geographical scenarios contributes to enhanced situational awareness. This study not only effectively extends geographical information on social media, but also provides valuable insights for accurately responding to public opinion.

The purpose of this paper is to create optimally located Facilitation Centers on this tourist circuit, evaluated through network analysis, thus creating an effective linkage between tourism and economic activities of the craftsmen who are the custodians of the cultural heritage of Puri.

The craft villages lying in and around this tourist circuit are surveyed to establish socio-economic condition of artisans, significance of the craft and spatial distribution of craft villages and the willingness of artisans to travel closer to the transport spine. Network analysis is used to assess the suitability of Facilitation Center location using travel time and distance as parameters. Finally, the sustainability of the Facilitation Centers is evaluated using a cost-benefit analysis (CBA).

The Facilitation Centers can be spatially developed at the strategic locations to expand tourist market. This will help in leveraging the economic benefits of tourism to a marginalized rural artisan community by creating a sustainable model.

The focus on festival can help to protect local cultural traditions, develop tourism and promote the economic, social and cultural developments of the destination. Dispersal strategies adopted aim to increase visitors' satisfaction with the product and thus entice them to stay longer in the destination.

The present paper aims to address challenges associated with path planning and obstacle avoidance in mobile robotics. It introduces a pioneering solution called the Bi-directional Adaptive Enhanced A* (BAEA*) algorithm, which uses a new bidirectional search strategy. This approach facilitates simultaneous exploration from both the starting and target nodes and improves the efficiency and effectiveness of the algorithm in navigation environments. By using the heuristic knowledge A*, the algorithm avoids unproductive blind exploration, helps to obtain more efficient data for identifying optimal solutions. The simulation results demonstrate the superior performance of the BAEA* algorithm in achieving rapid convergence towards an optimal action strategy compared to existing methods.

The paper adopts a careful design focusing on the development and evaluation of the BAEA* for mobile robot path planning, based on the reference [18]. The algorithm has remarkable adaptability to dynamically changing environments and ensures robust navigation in the context of environmental changes. Its scale further enhances its applicability in large and complex environments, which means it has flexibility for various practical applications. The rigorous evaluation of our proposed BAEA* algorithm with the Bidirectional adaptive A* (BAA*) algorithm [18] in five different environments demonstrates the superiority of the BAEA* algorithm. The BAEA* algorithm consistently outperforms BAA*, demonstrating its ability to plan shorter and more stable paths and achieve higher success rates in all environments.

The paper adopts a careful design focusing on the development and evaluation of the BAEA* for mobile robot path planning, based on the reference [18]. The algorithm has remarkable adaptability to dynamically changing environments and ensures robust navigation in the context of environmental changes. Its scale further enhances its applicability in large and complex environments, which means it has flexibility for various practical applications. The rigorous evaluation of our proposed BAEA* algorithm with the Bi-directional adaptive A* (BAA*) algorithm [18] in five different environments demonstrates the superiority of the BAEA* algorithm.

The rigorous evaluation of our proposed BAEA* algorithm with the BAA* algorithm [18] in five different environments demonstrates the superiority of the BAEA* algorithm. The BAEA* algorithm consistently outperforms BAA*, demonstrating its ability to plan shorter and more stable paths and achieve higher success rates in all environments.

The originality of this paper lies in the introduction of the bidirectional adaptive enhancing A* algorithm (BAEA*) as a novel solution for path planning for mobile robots. This algorithm is characterized by its unique characteristics that distinguish it from others in this field. First, BAEA* uses a unique bidirectional search strategy, allowing to explore the same path from both the initial node and the target node. This approach significantly improves efficiency by quickly converging to the best paths and using A* heuristic knowledge. In particular, the algorithm shows remarkable capabilities to quickly recognize shorter and more stable paths while ensuring higher success rates, which is an important feature for time-sensitive applications. In addition, BAEA* shows adaptability and robustness in dynamically changing environments, not only avoiding obstacles but also respecting various constraints, ensuring safe path selection. Its scale further increases its versatility by seamlessly applying it to extensive and complex environments, making it a versatile solution for a wide range of practical applications. The rigorous assessment against established algorithms such as BAA* consistently shows the superior performance of BAEA* in planning shorter paths, achieving higher success rates in different environments and cementing its importance in complex and challenging environments. This originality marks BAEA* as a pioneering contribution, increasing the efficiency, adaptability and applicability of mobile robot path planning methods.

This study aims to propose and evaluate the progress in the basic-pixel (a strategy to generate continuous trajectories that fill out the entire surface) algorithm towards performance gain. The objective is also to investigate the operational efficiency and effectiveness of an enhanced version compared with conventional strategies.

For the first objective, the proposed methodology is to apply the improvements proposed in the basic-pixel strategy, test it on three demonstrative parts and statistically evaluate the performance using the distance trajectory criterion. For the second objective, the enhanced-pixel strategy is compared with conventional strategies in terms of trajectory distance, build time and the number of arcs starts and stops (operational efficiency) and targeting the nominal geometry of a part (operational effectiveness).

The results showed that the improvements proposed to the basic-pixel strategy could generate continuous trajectories with shorter distances and comparable building times (operational efficiency). Regarding operational effectiveness, the parts built by the enhanced-pixel strategy presented lower dimensional deviation than the other strategies studied. Therefore, the enhanced-pixel strategy appears to be a good candidate for building more complex printable parts and delivering operational efficiency and effectiveness.

This paper presents an evolution of the basic-pixel strategy (a space-filling strategy) with the introduction of new elements in the algorithm and proves the improvement of the strategy’s performance with this. An interesting comparison is also presented in terms of operational efficiency and effectiveness between the enhanced-pixel strategy and conventional strategies.

Following behavioral finance and monetary wisdom, the authors theorize: Decision-makers (investors) adopt deep-rooted personal values (the love-of-money attitudes/avaricious financial aspirations) as a lens to frame critical concerns (short-term and long-term investment decisions) in the immediate-proximal (current income) and distal-omnibus (future inheritance) contexts to maximize expected utility and ultimate serenity across context, people and time.

The authors collected data from 277 active equity traders (professional money managers and individual investors) in Pakistan’s two most robust investment hubs—Karachi and Lahore. The authors measured their love-of-money attitude (avaricious monetary aspirations), short-term and long-term investment decisions and demographic variables and collected data during Pakistan's bear markets (Pakistan Stock Exchange, PSX-100).

Investors’ love of money relates to short-term and long-term decisions. However, these relationships are significant for money managers but non-significant for individual investors. Further, investors’ current income moderates this relationship for short-term investment decisions but not long-term decisions. The intensity of the aspirations-to-short-term investment relationship is much higher for investors with low-income levels than those with average and high-income levels. Future inheritance moderates the relationships between aspirations and short-term and long-term decisions. Regardless of their love-of-money orientations, investors with future inheritance have higher magnitudes of short-term and long-term investments than those without future inheritance. The intensity of the aspirations-to-investments relationship is more potent for investors without future inheritance than those with inheritance. Investors with low avaricious monetary aspirations and without inheritance expectations show the lowest short-term and long-term investment decisions. Investors' current income and future inheritance moderate the relationships between their love of money attitude and short-term and long-term decisions differently in Pakistan's bear markets.

The authors help investors make financial decisions and help financial institutions, asset management companies, brokerage houses and investment banks identify marketing strategies and investor segmentation and provide individualized services.

Professional money managers have a stronger short-term orientation than individual investors. Lack of wealth (current income and future inheritance) motivates greedy investors to take more risks and become more vulnerable than non-greedy ones—investors’ financial resources and wealth matter. The Matthew Effect in investment decisions exists in Pakistan’s emerging economy.