Results 41 to 50 of about 16,261 (217)
Path planning algorithm for a car-like robot based on cell decomposition method [PDF]
, 2013 This project proposes an obstacle avoiding path planning algorithm based on cell decomposition method for a car-like robot. Dijkstra’s algorithm is applied in order to find the shortest path. Using cell decomposition, the free space of the robot is
Omar, Nurhanum
core
Cloud Enabled Emergency Navigation Using Faster-than-real-time Simulation
, 2015 State-of-the-art emergency navigation approaches are designed to evacuate civilians during a disaster based on real-time decisions using a pre-defined algorithm and live sensory data.
Bi, Huibo, Gelenbe, Erol
core +1 more source
European Ports as Energy Hubs: A Sustainability Index to Assess Territorial Development
Business Strategy and the Environment, EarlyView.ABSTRACT The capacity of ports to act as energy hubs is increasingly relevant in light of sustainability challenges and global crises like the Ukraine conflict, the COVID‐19 pandemic and energy scarcity. Numerous international and national initiatives are shaping the future of port development to address environmental and economic concerns.
Paolo Mazzocchi +3 more
wiley +1 more source
Speeding up shortest path algorithms
, 2012 Given an arbitrary, non-negatively weighted, directed graph $G=(V,E)$ we present an algorithm that computes all pairs shortest paths in time $\mathcal{O}(m^* n + m \lg n + nT_\psi(m^*, n))$, where $m^*$ is the number of different edges contained in ...
A.V. Goldberg +10 more
core +1 more source
Business Strategy and the Environment, EarlyView.ABSTRACT This study investigates the impact of green human resource management (GHRM) practices on employee green behavioural intention (GBI) and in‐role green behaviour (EGB‐IR) in the hospitality sector. Drawing on conservation of resources (COR) theory, we examine the mediating roles of job satisfaction and employee well‐being as psychological ...
Vanessa Guerra‐Lombardi +3 more
wiley +1 more source
Системный анализ и прикладная информатикаIn this paper we consider two families of competing algorithms for finding the shortest paths between all pairs of vertices (APSP) in directed weighted large graphs with different edge densities: Dijkstra and Floyd-Warshall. For comparison, we have taken
A. A. Prihozhy, O. N. Karasik
doaj +1 more source
Efficient motion planning for problems lacking optimal substructure
, 2017 We consider the motion-planning problem of planning a collision-free path of a robot in the presence of risk zones. The robot is allowed to travel in these zones but is penalized in a super-linear fashion for consecutive accumulative time spent there. We
Hou, Brian +2 more
core +1 more source
Business Strategy and the Environment, EarlyView.ABSTRACT The supply chain consists of interconnected businesses and organisations responsible for the flow of goods and services. As firms increasingly adopt digital technologies, the spillover effects of supply chain digitalisation (SCD) on environmental performance remain underexplored.
Zengdong Cao +4 more
wiley +1 more source
Shortest Distances as Enumeration Problem
, 2021 We investigate the single source shortest distance (SSSD) and all pairs shortest distance (APSD) problems as enumeration problems (on unweighted and integer weighted graphs), meaning that the elements $(u, v, d(u, v))$ -- where $u$ and $v$ are vertices ...
Casel, Katrin +3 more
core
International Journal of Climatology, EarlyView.Using complex network theory and event synchronisation, we find distinct spatiotemporal structures of extreme precipitation and sea surface temperature events across the Northern Hemisphere. Our results show strong local and long‐range connectivity in terrestrial extremes, driven by atmospheric dynamics, contrasting with more localised marine extremes ...
Connor Saari +3 more
wiley +1 more source