1-20 of 16368
Follow your search
Access your saved searches in your account

Would you like to receive an alert when new items match your search?
Close Modal
Sort by
Journal Articles
Image
Image
Image
Image
Image
An MSN design configuration with multiple nodes at and across multiple groups and multiple edges connecting the nodes. Situations of node and edge disruptions and their impact on connectivity in the MSN are depicted.
Published Online: May 8, 2025
Fig. 5 An MSN design configuration with multiple nodes at and across multiple groups and multiple edges connecting the nodes. Situations of node and edge disruptions and their impact on connectivity in the MSN are depicted. More about this image found in An MSN design configuration with multiple nodes at and across multiple grou...
Image
Image
Image
Image
The iSOM plots for goals (Gg) for the steel MSN problem. The grid points highlighted using red hexagons in the iSOM goals plots represent the initial satisficing solutions regions for goals.
Published Online: May 8, 2025
Fig. 9 The iSOM plots for goals ( G g ) for the steel MSN problem. The grid points highlighted using red hexagons in the iSOM goals plots represent the initial satisficing solutions regions for goals. More about this image found in The iSOM plots for goals ( G g ) for the steel MSN problem. The grid...
Image
Satisficing solution plots for goals after relaxation of satisficing limits. The black hexagons represent the common satisficing grid points for the network, manufacturer group, and supplier group goals across levels 1 and 2.
Published Online: May 8, 2025
Fig. 10 Satisficing solution plots for goals after relaxation of satisficing limits. The black hexagons represent the common satisficing grid points for the network, manufacturer group, and supplier group goals across levels 1 and 2. More about this image found in Satisficing solution plots for goals after relaxation of satisficing limits...
Image
The network structure and materials flow in the steel MSN corresponding to design variables for scenario 97 in Tables 6–8. The ovals represent the nodes in each group, and the directed arrows represent the edges connecting the nodes.
Published Online: May 8, 2025
Fig. 11 The network structure and materials flow in the steel MSN corresponding to design variables for scenario 97 in Tables 6 – 8 . The ovals represent the nodes in each group, and the directed arrows represent the edges connecting the nodes. More about this image found in The network structure and materials flow in the steel MSN corresponding to ...
Journal Articles
Journal Articles
Image
The edges eij in our model have costs cij that behave as continuous random variables with associated probability distribution functions fij, making the costs incurred in transitions Tij not known a priori. However, we assume that the functions fij, which can have different profiles for each eij, are known or can be accurately modeled.
Published Online: May 7, 2025
Fig. 1 The edges e i j in our model have costs c i j that behave as continuous random variables with associated probability distribution functions f i j , making the costs incurred in transitions T i j not known a priori. However, we assume that the f... More about this image found in The edges e i j in our model have costs c i j that ...
Image
The g-cost g(ni,x) in our model is treated as a probability density function. To satisfy the node constraints, given by admissible intervals [ai,bi], the probability that g(ni,x) lies within Ii must be higher or equal to an user-defined threshold value δ. If the inequality is not satisfied, such as the case shown here, then any plan P that produces that g(ni,x) is ignored.
Published Online: May 7, 2025
Fig. 2 The g-cost g ( n i , x ) in our model is treated as a probability density function. To satisfy the node constraints, given by admissible intervals [ a i , b i ] , the probability that g ( n i , x ) lies within g k I i must be higher or... More about this image found in The g-cost g ( n i , x ) in our model is treated as a probabi...
Image
Our methodology is divided into two main sections: graph construction and plan optimization. Graph construction is done by creating a configuration graph of a discretized environment, and then time-augmenting it into a state graph. Plan optimization is done through a novel stochastic extension of A*. Throughout the process, there are a number of inputs provided by the user, as shown in the flowchart above.
Published Online: May 7, 2025
Fig. 3 Our methodology is divided into two main sections: graph construction and plan optimization. Graph construction is done by creating a configuration graph of a discretized environment, and then time-augmenting it into a state graph. Plan optimization is done through a novel stochastic extens... More about this image found in Our methodology is divided into two main sections: graph construction and p...
Image
The environment discretization process involves taking each entity, which could be obstacles or agents, sampling control points on their boundaries and connecting them with line segments. The discretized representation (darker gray) is assumed to correspond exactly to the agents geometry from this point on. The choice of number and location of the control points is left to the user. This example shows a C-shaped agent being represented by different numbers of control points.
Published Online: May 7, 2025
Fig. 4 The environment discretization process involves taking each entity, which could be obstacles or agents, sampling control points on their boundaries and connecting them with line segments. The discretized representation (darker gray) is assumed to correspond exactly to the agents geometry fr... More about this image found in The environment discretization process involves taking each entity, which c...
Image
Sampling is done after all entities in the environment are discretized. Our methodology employs a PRM approach that finds configurations ui that are collision-free with respect to static obstacles only. We show two examples of the sampling process, with different choices of agent geometry.
Published Online: May 7, 2025
Fig. 5 Sampling is done after all entities in the environment are discretized. Our methodology employs a PRM approach that finds configurations u i that are collision-free with respect to static obstacles only. We show two examples of the sampling process, with different choices of agent ... More about this image found in Sampling is done after all entities in the environment are discretized. Our...
Image
Each node of the original configuration graph Gu is assigned a number k of admissible intervals which restrict the allowed range of costs incurred once that node is reached. In our dynamic motion planning context, the cost is equivalent to time. When transitioning from Gu to Gs, each configuration with k intervals becomes k new states.
Published Online: May 7, 2025
Fig. 6 Each node of the original configuration graph G u is assigned a number k of admissible intervals which restrict the allowed range of costs incurred once that node is reached. In our dynamic motion planning context, the cost is equivalent to time. When transitioning from G... More about this image found in Each node of the original configuration graph G u is assigned a nu...