59 questions
0
votes
0
answers
6
views
Ros2-Foxy-Nav2 Local Costmap and Global Costmap won't start with the nav2_params
I have ackermann robot and I am trying to use nav2. When I use normal params, everything works normal, but these params are not good for ackermann as it gives spinning commands when creating path for ...
- 15
0
votes
0
answers
29
views
How to implement Follow the Gap method for Ackermann steering car in ROS 2 Gazebo?
I am trying to implement the Follow-The-Gap (FTG) algorithm for an F1TENTH-style Ackermann steering car in ROS 2 Humble, with Gazebo simulation.
I have completed the basic functionality: smoothing ...
0
votes
1
answer
60
views
Convert nested recursive algorithm (Ackermann's function) to iterative algorithm
I came across a practice problem:
I already wrote out the pseudocode for this, really easily too, just made the calls to the function as mention in the problem statement. But I was really struggling ...
- 315
0
votes
1
answer
2k
views
How to use ackermann plugin in ROS2 Humble
I'm working on a urdf model of an ackermann car with 4 wheels. I want to use the ackerman gazebo plugin, in the github i found an example of usage that is the following:
<gazebo>
<plugin ...
1
vote
1
answer
130
views
In Fortran IV, how are arrays assigned by a single value, and how are some goto operations handled?
I have a semantic problem with a very old Fortran IV (Fortran 66) program. This leads to 2 questions.
Context
The program should calculate the Ackermann function in O(1) memory. It comes from here:
...
43
votes
7
answers
7k
views
Theoretically can the Ackermann function be optimized?
I am wondering if there can be a version of Ackermann function with better time complexity than the standard variation.
This is not a homework and I am just curious. I know the Ackermann function ...
- 3,834
0
votes
0
answers
45
views
Getting seg fault for writing procedures in x86 32-bit compiled using NASM
Ackermann’s function A(m,n), where m ≥ 0 and n ≥ 0, is defined as
A(0, n) = n + 1
A(m + 1, 0) = A(m, 1)
A(m + 1, n + 1) = A(m,A(m+1,n))
I am trying to write the code for the above function but I am ...
- 43
8
votes
1
answer
501
views
Understanding Grossman & Zeitman's algorithm for computing the Ackermann function?
I've read the paper An inherently iterative computation of Ackermann's function, published by Grossman & Zeitman in which they present an algorithm which optimizes Ackermann's function.
We know ...
- 147
1
vote
1
answer
546
views
How can I optimize Ackermann Function?
I am required to find an optimization for the Ackermann function and explain the problem with the Ackermann problem itself. However, I'm not really sure where I should start. I understand that ...
- 147
4
votes
1
answer
399
views
Why is there such a massive difference in compile time between consteval/constexpr and template metafunctions?
I was curious how far I could push gcc as far as compile-time evaluation is concerned, so I made it compute the Ackermann function, specifically with input values of 4 and 1 (anything higher than that ...
- 105
0
votes
0
answers
199
views
How do you increase the stack size using MinGw G++ compiler?
I am trying to run the Ackermann function1 and I am having an issue. I am trying to run the program through my Command Prompt, on a Windows 10 machine, and a few seconds after reaching the value pair (...
- 1
0
votes
0
answers
60
views
Ackermann real numbers python
How can one compute the Ackermann function over nonnegative real numbers in Python per this question on Mathoverflow?
Here is my code for integers.
def naive_ackermann(m, n):
global calls
...
- 11
2
votes
1
answer
256
views
How to convert a variation of ackermann function to support tail call?
I'm currently solving a problem which is to implement a variation of ackermann function in scala with tail call optimization support so that the stack does not overflow.
The problem is, I cannot find ...
- 38
3
votes
0
answers
116
views
Ackermann function over the real numbers?
I was thinking about the Ackermann function, and whether or not it is possible to extend this function over the positive real numbers in Python.
def naive_ackermann(m, n):
calls = 0
calls += 1
...
- 197
0
votes
1
answer
393
views
Segmentation fault for numbers too big for Ackermann's function
Why is this failing? I have written Ackermann's function in C and used longs to make sure that no number will be too small. Yet, when I go above (including) 4 for m and n, it gives me a segmentation ...
- 976